Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCID19th LICS 2004: Turku, Finland
- 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings. IEEE Computer Society 2004, ISBN 0-7695-2192-4
Session 1
- Stefan Wöhrle, Wolfgang Thomas:
Model Checking Synchronized Products of Infinite Transition Systems. 2-11 - Javier Esparza
, Antonín Kucera, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. 12-21 - Michael Baldamus, Joachim Parrow, Björn Victor:
Spi Calculus Translated to ?--Calculus Preserving May-Tests. 22-31 - Andreas Podelski, Andrey Rybalchenko:
Transition Invariants. 32-41
Session 2
- Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. 44-53 - Joël Ouaknine, James Worrell:
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. 54-63 - Philippe de Groote, Bruno Guillaume, Sylvain Salvati:
Vector Addition Tree Automata. 64-73
Session 4
- Mihalis Yannakakis:
Testing, Optimizaton, and Games. 78-88 - Daniel Leivant:
Proving Termination Assertions in Dynamic Logics. 89-98
Session 5
- Sanjit A. Seshia, Randal E. Bryant:
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. 100-109 - Felix Klaedtke:
On the Automata Size for Presburger Arithmetic. 110-119 - Louis Latour:
From Automata to Formulas: Convex Integer Polyhedra. 120-129
Session 7
- Alexander A. Razborov:
Feasible Proofs and Computations: Partnership and Fusion. 134-138 - Murdoch Gabbay, James Cheney:
A Sequent Calculus for Nominal Logic. 139-148
Session 8
- Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark:
Nominal Games and Full Abstraction for the Nu-Calculus. 150-159 - Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski:
Games with Secure Equilibria. 160-169 - Luca de Alfaro, Patrice Godefroid, Radha Jagadeesan:
Three-Valued Abstractions of Games: Uncertainty, but with Precision. 170-179
Session 9
- Kazushige Terui:
Proof Nets and Boolean Circuits. 182-191 - Yohji Akama, Stefano Berardi, Susumu Hayashi, Ulrich Kohlenbach:
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. 192-201 - Benedetto Intrigila, Richard Statman:
The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. 202-210 - Carsten Führmann, David J. Pym:
On the Geometry of Interaction for Classical Logic. 211-220
Session 10
- Michael Huth:
Beyond Image-Finiteness: Labelled Transition Systems as a Stone Space. 222-231 - Víctor Dalmau, Andrei A. Krokhin, Benoît Larose:
First-Order Definable Retraction Problems for Posets and Reflexive Graph. 232-241 - Brian P. Dunphy, Uday S. Reddy:
Parametric Limits. 242-251
Session 11
- Robert Harper:
Self-Adjusting Computation. 254-255 - Stephen A. Cook, Neil Thapen:
The Strength of Replacement in Weak Arithmetic. 256-264
Session 12
- Patrick Baillot, Kazushige Terui:
Light Types for Polynomial Time Computation in Lambda-Calculus. 266-275 - Antonio Bucciarelli, Antonino Salibra:
The Sensible Graph Theories of Lambda Calculus. 276-285 - Tom Murphy VII, Karl Crary, Robert Harper, Frank Pfenning:
A Symmetric Modal Lambda Calculus for Distributed Computing. 286-295
Session 13
- Davide Sangiorgi:
Bisimulation: From The Origins to Today. 298-302 - Mohammad Reza Mousavi, Michel A. Reniers, Jan Friso Groote:
Congruence for SOS with Data. 303-312 - David A. Naumann, Michael Barnett:
Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State. 313-323
Session 14
- Ulrich Berger:
A Computational Interpretation of Open Induction. 326 - Dennis Dams, Kedar S. Namjoshi:
The Existence of Finite Abstractions for Branching Time Model Checking. 335-344 - Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata:
Multi-Clock Timed Networks. 345-354
Session 15
- Igor Walukiewicz:
A Landscape with Games in the Backgroun. 356-366 - Gustav Nordh, Peter Jonsson:
An Algebraic Approach to the Complexity of Propositional Circumscription. 367-376
Session 16
- Phuong Nguyen, Stephen A. Cook:
VTC circ: A Second-Order Theory for TCcirc. 378-387 - Jörg Flum, Martin Grohe:
Model-Checking Problems as a Basis for Parameterized Intractability. 388-397 - Stephen A. Cook, Antonina Kolokolova:
A Second-Order Theory for NL. 398-407
Session 17
- Samson Abramsky:
High-Level Methods for Quantum Computation and Information. 410-414 - Samson Abramsky, Bob Coecke:
A Categorical Semantics of Quantum Protocols. 415-425 - José Raymundo Marcial-Romero, Martín Hötzel Escardó:
Semantics of a Sequential Language for Exact Real-Number Computation. 426-435
Session 18
- Martin Grohe, Nicole Schweikardt:
The Succinctness of First-Order Logic on Linear Orders. 438-447 - Andrei A. Bulatov:
A Graph of a Relational Structure and Constraint Satisfaction Problems. 448-457 - Kerkko Luosto:
Equicardinality on Linear Orders. 458-465
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2021-04-16 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
