Abstract is missing.
- Front Cover [doi]
- Program Committee [doi]
- ForewordPrakash Panangaden. [doi]
- Conference Organization [doi]
- Additional Reviewers [doi]
- Cover Pages [doi]
- Relations in ConcurrencyGlynn Winskel. 2-11 [doi]
- Regular Expressions in Process AlgebraJos C. M. Baeten, Flavio Corradini. 12-19 [doi]
- Modal Characterisation Theorems over Special Classes of FramesAnuj Dawar, Martin Otto. 21-30 [doi]
- Temporal Logics over Unranked TreesPablo Barceló, Leonid Libkin. 31-40 [doi]
- On Locality and Uniform ReductionHannu Niemistö. 41-50 [doi]
- Looping CaterpillarsEvan Goris, Maarten Marx. 51-60 [doi]
- Generalizing Parametricity Using Information-flowGeoffrey Washburn, Stephanie Weirich. 62-71 [doi]
- Relational Parametricity and ControlMasahito Hasegawa. 72-81 [doi]
- Recursive Polymorphic Types and Parametricity in an Operational FrameworkPaul-André Melliès, Jerome Vouillon. 82-91 [doi]
- Semantic Subtyping for the p-CalculusGiuseppe Castagna, Rocco De Nicola, Daniele Varacca. 92-101 [doi]
- An Insider s Guide to Logic in Telecommunications DataMichael Benedikt. 104-105 [doi]
- On Digraph Coloring Problems and Treewidth DualityAlbert Atserias. 106-115 [doi]
- Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and VariancesJavier Esparza, Antonín Kucera, Richard Mayr. 117-126 [doi]
- Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness PropertyParosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr. 127-136 [doi]
- Recognizing omega-regular Languages with Probabilistic AutomataChristel Baier, Marcus Größer. 137-146 [doi]
- A Polynomial Time Presburger Criterion and Synthesis for Number Decision DiagramsJérôme Leroux. 147-156 [doi]
- Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal LogicsPatrice Godefroid, Michael Huth. 158-167 [doi]
- Model-Checking Hierarchical StructuresMarkus Lohrey. 168-177 [doi]
- Mean-Payoff Parity GamesKrishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski. 178-187 [doi]
- On the Decidability of Metric Temporal LogicJoël Ouaknine, James Worrell. 188-197 [doi]
- Closure Properties of Coalgebra AutomataClemens Kupke, Yde Venema. 199-208 [doi]
- Constructing Free Boolean CategoriesFrançois Lamarche, Lutz Straßburger. 209-218 [doi]
- Completions of µ-algebrasLuigi Santocanale. 219-228 [doi]
- Proof-Theoretic Approach to Description-LogicMartin Hofmann. 229-237 [doi]
- Process Algebras for Quantitative AnalysisJane Hillston. 239-248 [doi]
- A Functional Quantum Programming LanguageThorsten Altenkirch, Jonathan Grattage. 249-258 [doi]
- Semantics of Separation-Logic Typing and Higher-Order Frame RulesLars Birkedal, Noah Torp-Smith, Hongseok Yang. 260-269 [doi]
- An Observationally Complete Program Logic for Imperative Higher-Order Frame RulesKohei Honda, Nobuko Yoshida, Martin Berger. 270-279 [doi]
- Expressiveness of a Spatial Logic for TreesIovka Boneva, Jean-Marc Talbot, Sophie Tison. 280-289 [doi]
- Proof Theory for Kleene AlgebraChris Hardin. 290-299 [doi]
- Name Generation and LinearityGlynn Winskel. 301-310 [doi]
- Reactive Systems over CospansVladimiro Sassone, Pawel Sobocinski. 311-320 [doi]
- Uniform Distributed SynthesisBernd Finkbeiner, Sven Schewe. 321-330 [doi]
- Automated Verification of Selected Equivalences for Security ProtocolsBruno Blanchet, Martín Abadi, Cédric Fournet. 331-340 [doi]
- Tarski s Influence on Computer ScienceSolomon Feferman. 342 [doi]
- Logic and Systems BiologyWalter Fontana. 344 [doi]
- Eager Normal Form BisimulationSoren Lassen. 345-354 [doi]
- Separation with Streams in the lambdaµ-calculusAlexis Saurin. 356-365 [doi]
- The Geometry of Linear Higher-Order RecursionUgo Dal Lago. 366-375 [doi]
- Ludics Nets, a game Model of Concurrent InteractionClaudia Faggian, François Maurel. 376-385 [doi]
- Asynchronous Games 4: A Fully Complete Model of Propositional Linear LogicPaul-André Melliès. 386-395 [doi]
- Herbrand Constraint AbductionMichael J. Maher. 397-406 [doi]
- Certifying Compilation for a Language with Stack AllocationLimin Jia, Frances Spalding, David Walker, Neal Glew. 407-416 [doi]
- Inverse and Implicit Functions in Domain TheoryAbbas Edalat, Dirk Pattinson. 417-426 [doi]
- Operational Domain Theory and Topology of a Sequential Programming LanguageMartín Hötzel Escardó, Ho Weng Kin. 427-436 [doi]
- Generalized Majority-Minority Operations are TractableVíctor Dalmau. 438-447 [doi]
- Small Substructures and Decidability Issues for First-Order Logic with Two VariablesEmanuel Kieronski, Martin Otto. 448-457 [doi]
- Definability on a Random 3-CNF FormulaAlbert Atserias. 458-466 [doi]
- Existential Positive Types and Preservation under HomomorphisismsBenjamin Rossman. 467-476 [doi]