[Front cover]

Conference organization (PDF)

pp. x-xi

[Copyright notice] (PDF)

pp. iv

Table of contents (PDF)

pp. v-viii

Additional reviewers (PDF)

pp. xii-xiii

Title Page i (PDF)

pp. i

Title Page iii (PDF)

pp. iii

Foreword (PDF)

pp. ix

My 27-year Quest to Overcome the State Explosion Problem (Abstract)

Edmund M. Clarke

pp. 3

PDF

The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (Abstract)

Jérôme Leroux

pp. 4-13

PDF

Applications of Game Semantics: From Program Analysis to Hardware Synthesis (Abstract)

Dan R. Ghica

pp. 17-26

PDF

Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks (Abstract)

Vineet Kahlon

pp. 27-36

PDF

Psi-calculi: Mobile Processes, Nominal Data, and Logic (Abstract)

pp. 39-48

PDF

An Algebra for Kripke Polynomial Coalgebras (Abstract)

pp. 49-58

PDF

Trace Semantics is Fully Abstract (Abstract)

Sumit Nain

Moshe Y. Vardi

pp. 59-68

PDF

Logical Step-Indexed Logical Relations (Abstract)

pp. 71-80

PDF

Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (Abstract)

Luís Dominguez

pp. 81-90

PDF

Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus (Abstract)

Alberto Carraro

Antonino Salibra

pp. 91-100

PDF

Substructural Operational Semantics as Ordered Logic Programming (Abstract)

Frank Pfenning

Robert J. Simmons

pp. 101-110

PDF

Logics with Rank Operators (Abstract)

pp. 113-122

PDF

On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (Abstract)

Emanuel Kieronski

Lidia Tendera

pp. 123-132

PDF

Pointer Programs and Undirected Reachability (Abstract)

Martin Hofmann

Ulrich Schöpp

pp. 133-142

PDF

An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (Abstract)

Oliver Friedmann

pp. 145-156

PDF

Graph Reachability and Pebble Automata over Infinite Alphabets (Abstract)

Tony Tan

pp. 157-166

PDF

An Improved Lower Bound for the Complementation of Rabin Automata (Abstract)

pp. 167-176

PDF

A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes (Abstract)

Naoki Kobayashi

C.-H. Luke Ong

pp. 179-188

PDF

Clipping: A Semantics-Directed Syntactic Approximation (Abstract)

Dan R. Ghica

Adam Bakewell

pp. 189-198

PDF

Expressiveness and Closure Properties for Quantitative Languages (Abstract)

Krishnendu Chatterjee

Laurent Doyen

Thomas A. Henzinger

pp. 199-208

PDF

Computation and the Periodic Table (Abstract)

John Baez

pp. 211

PDF

The Structure of First-Order Causality (Abstract)

Samuel Mimram

pp. 212-221

PDF

The Inverse Taylor Expansion Problem in Linear Logic (Abstract)

Michele Pagani

Christine Tasson

pp. 222-231

PDF

On the Computational Complexity of Verifying One-Counter Processes (Abstract)

pp. 235-244

PDF

Co-ing Büchi Made Tight and Useful (Abstract)

Udi Boker

Orna Kupferman

pp. 245-254

PDF

Wreath Products of Forest Algebras, with Applications to Tree Logics (Abstract)

pp. 255-263

PDF

Dinatural Terms in System F (Abstract)

Joachim de Lataillade

pp. 267-276

PDF

[Roster] (PDF)

pp. 442

Indexed Containers (Abstract)

Thorsten Altenkirch

Peter Morris

pp. 277-285

PDF

Functional Reachability (Abstract)

C.-H. Luke Ong

Nikos Tzevelekos

pp. 286-295

PDF

Statistic Analysis for Probabilistic Processes (Abstract)

Michel de Rougemont

Mathieu Tracol

pp. 299-308

PDF

Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Abstract)

pp. 309-318

PDF

Qualitative Determinacy and Decidability of Stochastic Games with Signals (Abstract)

pp. 319-328

PDF

Combining Ehrenfeucht-Fraïssé Games (Abstract)

Benjamin Rossman

pp. 331

PDF

Kristoffer Arnsfelt Hansen

Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (Abstract)

Michal Koucký

Peter Bro Miltersen

pp. 332-341

PDF

Graded Computation Tree Logic (Abstract)

pp. 342-351

PDF

A Unified Sequent Calculus for Focused Proofs (Abstract)

Chuck Liang

Dale Miller

pp. 355-364

PDF

Non-linear Rewrite Closure and Weak Normalization (Abstract)

pp. 365-374

PDF

Ludics with Repetitions (Exponentials, Interactive Types and Completeness) (Abstract)

Michele Basaldella

Claudia Faggian

pp. 375-384

PDF

Trichotomy in the Complexity of Minimal Inference (Abstract)

pp. 387-396

PDF

A Logic for PTIME and a Parameterized Halting Problem (Abstract)

Yijia Chen

Jörg Flum

pp. 397-406

PDF

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics (Abstract)

Yevgeny Kazakov

Ian Pratt-Hartmann

pp. 407-416

PDF

The Complexity of Global Cardinality Constraints (Abstract)

Andrei A. Bulatov

Dániel Marx

pp. 419-428

PDF

The Complexity of Positive First-order Logic without Equality (Abstract)

Florent Madelaine

Barnaby Martin

pp. 429-438

PDF

Author Index (PDF)

pp. 439-440