Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar22. LICS 2007: Wroclaw, Poland
22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings. IEEE Computer Society 2007, ISBN 0-7695-2908-9
Type Theory
- Andreas Abel, Thierry Coquand, Peter Dybjer:
Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements. 3-12
Computational Proof Theory
Security
- Michael O. Rabin, Rocco A. Servedio, Christopher Thorpe:
Highly Efficient Secrecy-Preserving Proofs of Correctness of Computations and Applications. 63-76
Timed and Stochastic Systems
- Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, Mariëlle Stoelinga:
Game Relations and Metrics. 99-108
Verification
- Angelo Montanari, Gabriele Puppis:
A Contraction Method to Decide MSO Theories of Deterministic Trees. 141-150 - Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman, Leonid Libkin:
First-Order and Temporal Logics for Nested Words. 151-160 - Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato:
A Robust Class of Context-Sensitive Languages. 161-170 - Detlef Kähler, Ralf Küsters, Tomasz Truderung:
Infinite State AMC-Model Checking for Cryptographic Protocols. 181-192
Constraints
- László Egri, Benoit Larose, Pascal Tesson:
Symmetric Datalog and Constraint Satisfaction Problems in Logspace. 193-202 - Pawel M. Idziak, Petar Markovic, Ralph McKenzie, Matthew Valeriote, Ross Willard:
Tractability and learnability arising from algebras with few subpowers. 213-224
Proof Complexity
- Phuong Nguyen, Stephen A. Cook:
The Complexity of Proving the Discrete Jordan Curve Theorem. 245-256
Finite Model Theory
- Balder ten Cate, Johan van Benthem, Jouko A. Väänänen:
Lindstrom theorems for fragments of first-order logic. 280-292
Concurrency and Process Calculi
- Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii:
Environmental Bisimulations for Higher-Order Languages. 293-302 - Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang:
Characterising Testing Preorders for Finite Probabilistic Processes. 313-325
Semantics of Programming Languages
- Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yang:
Local Action and Abstract Separation Logic. 366-378
Game Semantics
- Russell Harmer, Martin Hyland, Paul-André Melliès:
Categorical Combinatorics for Innocent Strategies. 379-388
Linear Logic
- Patrick Baillot, Paolo Coppola, Ugo Dal Lago:
Light Logics and Optimal Reduction: Completeness and Complexity. 421-430
Topology and Computable Mathematics
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-29 23:36 CEST by the dblp team