| 2009 | A Logic for PTIME and a Parameterized Halting Problem. Yijia Chen, Jörg Flum |
| 2009 | A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. Yevgeny Kazakov, Ian Pratt-Hartmann |
| 2009 | A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. Naoki Kobayashi, C.-H. Luke Ong |
| 2009 | A Unified Sequent Calculus for Focused Proofs. Chuck C. Liang, Dale Miller |
| 2009 | An Algebra for Kripke Polynomial Coalgebras. Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva |
| 2009 | An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. Oliver Friedmann |
| 2009 | An Improved Lower Bound for the Complementation of Rabin Automata. Yang Cai, Ting Zhang, Haifeng Luo |
| 2009 | Applications of Game Semantics: From Program Analysis to Hardware Synthesis. Dan R. Ghica |
| 2009 | Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks. Vineet Kahlon |
| 2009 | Clipping: A Semantics-Directed Syntactic Approximation. Dan R. Ghica, Adam Bakewell |
| 2009 | Co-ing Büchi Made Tight and Useful. Udi Boker, Orna Kupferman |
| 2009 | Combining Ehrenfeucht-Fraïssé Games. Benjamin Rossman |
| 2009 | Computation and the Periodic Table. John Baez |
| 2009 | Dinatural Terms in System F. Joachim De Lataillade |
| 2009 | Expressiveness and Closure Properties for Quantitative Languages. Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger |
| 2009 | Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus. Luís Dominguez |
| 2009 | Functional Reachability. C.-H. Luke Ong, Nikos Tzevelekos |
| 2009 | Graded Computation Tree Logic. Alessandro Bianco, Fabio Mogavero, Aniello Murano |
| 2009 | Graph Reachability and Pebble Automata over Infinite Alphabets. Tony Tan |
| 2009 | Indexed Containers. Thorsten Altenkirch, Peter Morris |
| 2009 | Logical Step-Indexed Logical Relations. Derek Dreyer, Amal Ahmed, Lars Birkedal |
| 2009 | Logics with Rank Operators. Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner |
| 2009 | Ludics with Repetitions (Exponentials, Interactive Types and Completeness). Michele Basaldella, Claudia Faggian |
| 2009 | My 27-year Quest to Overcome the State Explosion Problem. Edmund M. Clarke |
| 2009 | Non-linear Rewrite Closure and Weak Normalization. Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari |
| 2009 | On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. Emanuel Kieronski, Lidia Tendera |
| 2009 | On the Computational Complexity of Verifying One-Counter Processes. Stefan Göller, Richard Mayr, Anthony Widjaja To |
| 2009 | Pointer Programs and Undirected Reachability. Martin Hofmann, Ulrich Schöpp |
| 2009 | Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA |
| 2009 | Psi-calculi: Mobile Processes, Nominal Data, and Logic. Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor |
| 2009 | Qualitative Determinacy and Decidability of Stochastic Games with Signals. Nathalie Bertrand, Blaise Genest, Hugo Gimbert |
| 2009 | Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications. Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre |
| 2009 | Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus. Alberto Carraro, Antonino Salibra |
| 2009 | Statistic Analysis for Probabilistic Processes. Michel de Rougemont, Mathieu Tracol |
| 2009 | Substructural Operational Semantics as Ordered Logic Programming. Frank Pfenning, Robert J. Simmons |
| 2009 | The Complexity of Global Cardinality Constraints. Andrei A. Bulatov, Dániel Marx |
| 2009 | The Complexity of Positive First-order Logic without Equality. Florent R. Madelaine, Barnaby Martin |
| 2009 | The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. Jérôme Leroux |
| 2009 | The Inverse Taylor Expansion Problem in Linear Logic. Michele Pagani, Christine Tasson |
| 2009 | The Structure of First-Order Causality. Samuel Mimram |
| 2009 | Trace Semantics is Fully Abstract. Sumit Nain, Moshe Y. Vardi |
| 2009 | Trichotomy in the Complexity of Minimal Inference. Arnaud Durand, Miki Hermann, Gustav Nordh |
| 2009 | Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen |
| 2009 | Wreath Products of Forest Algebras, with Applications to Tree Logics. Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz |