Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar21. LICS 2006: Seattle, WA, USA
21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings. IEEE Computer Society 2006, ISBN 0-7695-2631-4
Introduction
- Foreward.
- Conference Organization.
- Organizing Committee.
- Reviewers.
Plenary Talk
Session 1: Complexity and Decidability
- Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David:
Two-Variable Logic on Words with Data. 7-16
Session 2: Concurrency
- Marcelo P. Fiore, Sam Staton:
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics. 49-58 - Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, Björn Victor:
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. 59-68
Session 3: Pushdown Systems
- Dietrich Kuske, Markus Lohrey:
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. 91-100 - Vineet Kahlon, Aarti Gupta:
An Automata-Theoretic Approach for Model Checking Threads for LTL Propert. 101-110 - Tachio Terauchi, Alex Aiken:
On Typability for Rank-2 Intersection Types with Polymorphic Recursion. 111-122
Invited Talk
Session 4: Logics of Program
- Matthew J. Parkinson, Richard Bornat, Cristiano Calcagno:
Variables as Resource in Hoare Logics. 137-146 - Daniel Leivant:
Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. 157-168
Session 5: Proof Theory
- Olivier Laurent, Lorenzo Tortora de Falco:
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity. 179-188 - Alexis Maciel, Toniann Pitassi:
Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. 189-200
Session 6: Model Theory
- Benoit Larose, Cynthia Loten, Claude Tardif:
A Characterisation of First-Order Constraint Satisfaction Problems. 201-210 - Laura Chaubard, Jean-Eric Pin, Howard Straubing:
First Order Formulas with Modular Predicates. 211-220
Invited Talk
Session 7: Temporal Logics and Automata
- Nir Piterman:
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata. 255-264
Session 8: Lambda Calculus
- Makoto Tatsuta, Mariangiola Dezani-Ciancaglini:
Normalisation is Insensible to lambda-Term Identity or Difference. 327-338
Keynote Session: Celebrating Birth Centennial of Kurt Godel
- John W. Dawson:
Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel's Impact on Logic, Mathematics, and Computer Science. 339-341
Invited Talk
Session 9: Timed and Stochastic Systems
- Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera:
Stochastic Games with Branching-Time Winning Objectives. 349-358
Session 10: Verification
- Daniele Varacca, Hagen Völzer:
Temporal Logics and Model Checking for Fairly Correct Systems. 389-398
Session 11: Approximations
- Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Approximation Schemes for First-Order Definable Optimisation Problems. 411-420 - Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. 421-430
maintained by 
at 
at 
last updated on 2018-10-17 22:25 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint