The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
2004 (conf/lics/2004)

  1. Stefan Wöhrle, Wolfgang Thomas
    Model Checking Synchronized Products of Infinite Transition Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:2-11 [Conf]
  2. Javier Esparza, Antonín Kucera, Richard Mayr
    Model Checking Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:12-21 [Conf]
  3. Michael Baldamus, Joachim Parrow, Björn Victor
    Spi Calculus Translated to ?--Calculus Preserving May-Tests. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:22-31 [Conf]
  4. Andreas Podelski, Andrey Rybalchenko
    Transition Invariants. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:32-41 [Conf]
  5. Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
    Automatic Structures: Richness and Limitations. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:44-53 [Conf]
  6. Joël Ouaknine, James Worrell
    On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:54-63 [Conf]
  7. Philippe de Groote, Bruno Guillaume, Sylvain Salvati
    Vector Addition Tree Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:64-73 [Conf]
  8. Mihalis Yannakakis
    Testing, Optimizaton, and Games. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:78-88 [Conf]
  9. Daniel Leivant
    Proving Termination Assertions in Dynamic Logics. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:89-98 [Conf]
  10. Sanjit A. Seshia, Randal E. Bryant
    Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:100-109 [Conf]
  11. Felix Klaedtke
    On the Automata Size for Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:110-119 [Conf]
  12. Louis Latour
    From Automata to Formulas: Convex Integer Polyhedra. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:120-129 [Conf]
  13. Alexander A. Razborov
    Feasible Proofs and Computations: Partnership and Fusion. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:134-138 [Conf]
  14. Murdoch Gabbay, James Cheney
    A Sequent Calculus for Nominal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:139-148 [Conf]
  15. Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian D. B. Stark
    Nominal Games and Full Abstraction for the Nu-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:150-159 [Conf]
  16. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Games with Secure Equilibria. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:160-169 [Conf]
  17. Luca de Alfaro, Patrice Godefroid, Radha Jagadeesan
    Three-Valued Abstractions of Games: Uncertainty, but with Precision. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:170-179 [Conf]
  18. Kazushige Terui
    Proof Nets and Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:182-191 [Conf]
  19. Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach
    An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:192-201 [Conf]
  20. Benedetto Intrigila, Richard Statman
    The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:202-210 [Conf]
  21. Carsten Führmann, David J. Pym
    On the Geometry of Interaction for Classical Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:211-220 [Conf]
  22. Michael Huth
    Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:222-231 [Conf]
  23. Víctor Dalmau, Andrei A. Krokhin, Benoit Larose
    First-Order Definable Retraction Problems for Posets and Reflexive Graph. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:232-241 [Conf]
  24. Brian Dunphy, Uday S. Reddy
    Parametric Limits. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:242-251 [Conf]
  25. Robert Harper
    Self-Adjusting Computation. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:254-255 [Conf]
  26. Stephen A. Cook, Neil Thapen
    The Strength of Replacement in Weak Arithmetic. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:256-264 [Conf]
  27. Patrick Baillot, Kazushige Terui
    Light Types for Polynomial Time Computation in Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:266-275 [Conf]
  28. Antonio Bucciarelli, Antonino Salibra
    The Sensible Graph Theories of Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:276-285 [Conf]
  29. Tom Murphy VII, Karl Crary, Robert Harper, Frank Pfenning
    A Symmetric Modal Lambda Calculus for Distributed Computing. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:286-295 [Conf]
  30. Davide Sangiorgi
    Bisimulation: From The Origins to Today. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:298-302 [Conf]
  31. Mohammad Reza Mousavi, Michel A. Reniers, Jan Friso Groote
    Congruence for SOS with Data. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:303-312 [Conf]
  32. David A. Naumann, Michael Barnett
    Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:313-323 [Conf]
  33. Ulrich Berger
    A Computational Interpretation of Open Induction. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:326- [Conf]
  34. Dennis Dams, Kedar S. Namjoshi
    The Existence of Finite Abstractions for Branching Time Model Checking. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:335-344 [Conf]
  35. Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata
    Multi-Clock Timed Networks. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:345-354 [Conf]
  36. Igor Walukiewicz
    A Landscape with Games in the Backgroun. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:356-366 [Conf]
  37. Gustav Nordh, Peter Jonsson
    An Algebraic Approach to the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:367-376 [Conf]
  38. Phuong Nguyen, Stephen A. Cook
    VTC circ: A Second-Order Theory for TCcirc. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:378-387 [Conf]
  39. Jörg Flum, Martin Grohe
    Model-Checking Problems as a Basis for Parameterized Intractability. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:388-397 [Conf]
  40. Stephen A. Cook, Antonina Kolokolova
    A Second-Order Theory for NL. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:398-407 [Conf]
  41. Samson Abramsky
    High-Level Methods for Quantum Computation and Information. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:410-414 [Conf]
  42. Samson Abramsky, Bob Coecke
    A Categorical Semantics of Quantum Protocols. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:415-425 [Conf]
  43. J. Raymundo Marcial-Romero, Martín Hötzel Escardó
    Semantics of a Sequential Language for Exact Real-Number Computation. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:426-435 [Conf]
  44. Martin Grohe, Nicole Schweikardt
    The Succinctness of First-Order Logic on Linear Orders. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:438-447 [Conf]
  45. Andrei A. Bulatov
    A Graph of a Relational Structure and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:448-457 [Conf]
  46. Kerkko Luosto
    Equicardinality on Linear Orders. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:458-465 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002