Table of Contents

• My 27-year Quest to Overcome the State Explosion ProblemEdmund M. Clarke. 3 [doi]
• Applications of Game Semantics: From Program Analysis to Hardware SynthesisDan R. Ghica. 17-26 [doi]
• Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via LocksVineet Kahlon. 27-36 [doi]
• Psi-calculi: Mobile Processes, Nominal Data, and LogicJesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor. 39-48 [doi]
• An Algebra for Kripke Polynomial CoalgebrasMarcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva. 49-58 [doi]
• Trace Semantics is Fully AbstractSumit Nain, Moshe Y. Vardi. 59-68 [doi]
• Logical Step-Indexed Logical RelationsDerek Dreyer, Amal Ahmed, Lars Birkedal. 71-80 [doi]
• Fully Abstract Logical Bisimilarity for a Polymorphic Object CalculusLuís Dominguez. 81-90 [doi]
• Reflexive Scott Domains are Not Complete for the Extensional Lambda CalculusAlberto Carraro, Antonino Salibra. 91-100 [doi]
• Substructural Operational Semantics as Ordered Logic ProgrammingFrank Pfenning, Robert J. Simmons. 101-110 [doi]
• Logics with Rank OperatorsAnuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner. 113-122 [doi]
• On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence RelationsEmanuel Kieronski, Lidia Tendera. 123-132 [doi]
• Pointer Programs and Undirected ReachabilityMartin Hofmann, Ulrich Schöpp. 133-142 [doi]
• An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know itOliver Friedmann. 145-156 [doi]
• Graph Reachability and Pebble Automata over Infinite AlphabetsTony Tan. 157-166 [doi]
• An Improved Lower Bound for the Complementation of Rabin AutomataYang Cai, Ting Zhang, Haifeng Luo. 167-176 [doi]
• A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion SchemesNaoki Kobayashi, C.-H. Luke Ong. 179-188 [doi]
• Clipping: A Semantics-Directed Syntactic ApproximationDan R. Ghica, Adam Bakewell. 189-198 [doi]
• Expressiveness and Closure Properties for Quantitative LanguagesKrishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger. 199-208 [doi]
• Computation and the Periodic TableJohn Baez. 211 [doi]
• The Structure of First-Order CausalitySamuel Mimram. 212-221 [doi]
• The Inverse Taylor Expansion Problem in Linear LogicMichele Pagani, Christine Tasson. 222-231 [doi]
• On the Computational Complexity of Verifying One-Counter ProcessesStefan Göller, Richard Mayr, Anthony Widjaja To. 235-244 [doi]
• Co-ing Büchi Made Tight and UsefulUdi Boker, Orna Kupferman. 245-254 [doi]
• Wreath Products of Forest Algebras, with Applications to Tree LogicsMikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz. 255-263 [doi]
• Dinatural Terms in System FJoachim De Lataillade. 267-276 [doi]
• Indexed ContainersThorsten Altenkirch, Peter Morris. 277-285 [doi]
• Functional ReachabilityC.-H. Luke Ong, Nikos Tzevelekos. 286-295 [doi]
• Statistic Analysis for Probabilistic ProcessesMichel de Rougemont, Mathieu Tracol. 299-308 [doi]
• Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata SpecificationsTaolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre. 309-318 [doi]
• Qualitative Determinacy and Decidability of Stochastic Games with SignalsNathalie Bertrand, Blaise Genest, Hugo Gimbert. 319-328 [doi]
• Combining Ehrenfeucht-Fraïssé GamesBenjamin Rossman. 331 [doi]
• Winning Concurrent Reachability Games Requires Doubly-Exponential PatienceKristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen. 332-341 [doi]
• Graded Computation Tree LogicAlessandro Bianco, Fabio Mogavero, Aniello Murano. 342-351 [doi]
• A Unified Sequent Calculus for Focused ProofsChuck Liang, Dale Miller. 355-364 [doi]
• Non-linear Rewrite Closure and Weak NormalizationCarles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari. 365-374 [doi]
• Ludics with Repetitions (Exponentials, Interactive Types and Completeness)Michele Basaldella, Claudia Faggian. 375-384 [doi]
• Trichotomy in the Complexity of Minimal InferenceArnaud Durand, Miki Hermann, Gustav Nordh. 387-396 [doi]
• A Logic for PTIME and a Parameterized Halting ProblemYijia Chen, Jörg Flum. 397-406 [doi]
• A Note on the Complexity of the Satisfiability Problem for Graded Modal LogicsYevgeny Kazakov, Ian Pratt-Hartmann. 407-416 [doi]
• The Complexity of Global Cardinality ConstraintsAndrei A. Bulatov, Dániel Marx. 419-428 [doi]
• The Complexity of Positive First-order Logic without EqualityFlorent R. Madelaine, Barnaby Martin. 429-438 [doi]