Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar19th 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 - Michael Baldamus, Joachim Parrow, Björn Victor:
Spi Calculus Translated to ?--Calculus Preserving May-Tests. 22-31
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
Session 4
Session 5
- Sanjit A. Seshia, Randal E. Bryant:
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds. 100-109
Session 7
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
- 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
Session 10
- Víctor Dalmau, Andrei A. Krokhin, Benoit Larose:
First-Order Definable Retraction Problems for Posets and Reflexive Graph. 232-241
Session 11
Session 12
- Patrick Baillot, Kazushige Terui:
Light Types for Polynomial Time Computation in Lambda-Calculus. 266-275 - Tom Murphy VII, Karl Crary, Robert Harper, Frank Pfenning:
A Symmetric Modal Lambda Calculus for Distributed Computing. 286-295
Session 13
- David A. Naumann, Michael Barnett:
Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State. 313-323
Session 14
- Dennis Dams, Kedar S. Namjoshi:
The Existence of Finite Abstractions for Branching Time Model Checking. 335-344
Session 15
- Gustav Nordh, Peter Jonsson:
An Algebraic Approach to the Complexity of Propositional Circumscription. 367-376
Session 16
- Jörg Flum, Martin Grohe:
Model-Checking Problems as a Basis for Parameterized Intractability. 388-397
Session 17
- José Raymundo Marcial-Romero, Martín Hötzel Escardó:
Semantics of a Sequential Language for Exact Real-Number Computation. 426-435
Session 18
maintained by 
, founded at 
, founded at 
last updated on 2019-02-14 21:51 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
