Abstract is missing.
- Conference Organization [doi]
- Organizing Committee [doi]
- Reviewers [doi]
- Foreward [doi]
- Formal Verification of Infinite State Systems Using Boolean MethodsRandal E. Bryant. 3-4 [doi]
- Two-Variable Logic on Words with DataMikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David. 7-16 [doi]
- LTL with the Freeze Quantifier and Register AutomataStéphane Demri, Ranko Lazic. 17-26 [doi]
- Fixed-Parameter Hierarchies inside PSPACEGuoqiang Pan, Moshe Y. Vardi. 27-36 [doi]
- The Boundedness Problem for Monadic Universal First-Order LogicMartin Otto. 37-48 [doi]
- A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational SemanticsMarcelo P. Fiore, Sam Staton. 49-58 [doi]
- On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-CalculusCatuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, Björn Victor. 59-68 [doi]
- Saturated Semantics for Reactive SystemsFilippo Bonchi, Barbara König, Ugo Montanari. 69-80 [doi]
- On Model-Checking Trees Generated by Higher-Order Recursion SchemesC.-H. Luke Ong. 81-90 [doi]
- Monadic Chain Logic Over Iterations and Applications to Pushdown SystemsDietrich Kuske, Markus Lohrey. 91-100 [doi]
- An Automata-Theoretic Approach for Model Checking Threads for LTL PropertVineet Kahlon, Aarti Gupta. 101-110 [doi]
- On Typability for Rank-2 Intersection Types with Polymorphic RecursionTachio Terauchi, Alex Aiken. 111-122 [doi]
- Adapting LogicsAndreas Blass. 123 [doi]
- Managing Digital Rights using Linear LogicAdam Barth, John C. Mitchell. 127-136 [doi]
- Variables as Resource in Hoare LogicsMatthew J. Parkinson, Richard Bornat, Cristiano Calcagno. 137-146 [doi]
- Independence and Concurrent Separation LogicJonathan Hayman, Glynn Winskel. 147-156 [doi]
- Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic LogicDaniel Leivant. 157-168 [doi]
- Context Semantics, Linear Logic and Computational ComplexityUgo Dal Lago. 169-178 [doi]
- Obsessional Cliques: A Semantic Characterization of Bounded Time ComplexityOlivier Laurent, Lorenzo Tortora de Falco. 179-188 [doi]
- Conditional Lower Bound for a System of Constant-Depth Proofs with Modular ConnectivesAlexis Maciel, Toniann Pitassi. 189-200 [doi]
- A Characterisation of First-Order Constraint Satisfaction ProblemsBenoit Larose, Cynthia Loten, Claude Tardif. 201-210 [doi]
- First Order Formulas with Modular PpredicatesLaura Chaubard, Jean-Eric Pin, Howard Straubing. 211-220 [doi]
- On Tractability and Congruence DistributivityEmil W. Kiss, Matthew Valeriote. 221-230 [doi]
- PSPACE Bounds for Rank-1 Modal LogicsLutz Schröder, Dirk Pattinson. 231-242 [doi]
- Avoiding DeterminizationOrna Kupferman. 243-254 [doi]
- From Nondeterministic Buchi and Streett Automata to Deterministic Parity AutomataNir Piterman. 255-264 [doi]
- Memoryful Branching-Time LogicOrna Kupferman, Moshe Y. Vardi. 265-274 [doi]
- Faster Solutions of Rabin and Streett GamesNir Piterman, Amir Pnueli. 275-284 [doi]
- Bounds in w-RegularityMikolaj Bojanczyk, Thomas Colcombet. 285-296 [doi]
- Head Normal Form Bisimulation for Pairs and the /lambda/mu-CalculusSøren B. Lassen. 297-306 [doi]
- A Proof of Strong Normalisation using Domain TheoryThierry Coquand, Arnaud Spiwack. 307-316 [doi]
- Boolean Algebras for Lambda CalculusGiulio Manzonetto, Antonino Salibra. 317-326 [doi]
- Normalisation is Insensible to lambda-Term Identity or DifferenceMakoto Tatsuta, Mariangiola Dezani-Ciancaglini. 327-338 [doi]
- Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel s Impact on Logic, Mathematics, and Computer ScienceJohn W. Dawson. 339-341 [doi]
- Provable Implementations of Security ProtocolsAndrew D. Gordon. 345-346 [doi]
- Stochastic Games with Branching-Time Winning ObjectivesTomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera. 349-358 [doi]
- Coinductive Proof Principles for Stochastic ProcessesDexter Kozen. 359-366 [doi]
- Control in o-minimal Hybrid SystemsPatricia Bouyer, Thomas Brihaye, Fabrice Chevalier. 367-378 [doi]
- An Abstraction-Refinement Framework for Multi-Agent SystemsThomas Ball, Orna Kupferman. 379-388 [doi]
- Temporal Logics and Model Checking for Fairly Correct SystemsDaniele Varacca, Hagen Völzer. 389-398 [doi]
- 3-Valued Abstraction: More Precision at Less CostSharon Shoham, Orna Grumberg. 399-410 [doi]
- Approximation Schemes for First-Order Definable Optimisation ProblemsAnuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt. 411-420 [doi]
- Approximate Satisfiability and EquivalenceEldar Fischer, Frédéric Magniez, Michel de Rougemont. 421-430 [doi]