| 2012 | Deciding the Value 1 Problem for Probabilistic Leaktight Automata. | Nathanal Fijalkow, Hugo Gimbert, Youssouf Oualhadj |
| 2012 | Privacy, Anonymity, and Accountability in Ad-Supported Services. | Joan Feigenbaum |
| 2012 | A Perfect Model for Bounded Verification. | Javier Esparza, Pierre Ganty, Rupak Majumdar |
| 2012 | First-Order and Monadic Second-Order Model-Checking on Ordered Structures. | Viktor Engelmann, Stephan Kreutzer, Sebastian Siebertz |
| 2012 | Where First-Order and Monadic Second-Order Logic Coincide. | Michael Elberfeld, Martin Grohe, Till Tantau |
| 2012 | The HOM Problem is EXPTIME-Complete. | Carles Creus, Adri Gascn, Guillem Godoy, Lander Ramos |
| 2012 | On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer. | Robert L. Constable |
| 2012 | Strong Complementarity and Non-locality in Categorical Quantum Mechanics. | Bob Coecke, Ross Duncan, Aleks Kissinger, Quanlong Wang |
| 2012 | The Winning Ways of Concurrent Games. | Pierre Clairambault, Julian Gutierrez, Glynn Winskel |
| 2012 | An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. | Hubie Chen, Moritz Mller |
| 2012 | On the Ordered Conjecture. | Yijia Chen, Jrg Flum |
| 2012 | Decomposing Quantified Conjunctive (or Disjunctive) Formulas. | Hubie Chen, Vctor Dalmau |
| 2012 | Mean-Payoff Pushdown Games. | Krishnendu Chatterjee, Yaron Velner |
| 2012 | Decidable Problems for Probabilistic Automata on Infinite Words. | Krishnendu Chatterjee, Mathieu Tracol |
| 2012 | Partial-Observation Stochastic Games: How to Win When Belief Fails. | Krishnendu Chatterjee, Laurent Doyen |
| 2012 | Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. | Arnaud Carayol, Olivier Serre |
| 2012 | On the Magnitude of Completeness Thresholds in Bounded Model Checking. | Daniel Bundala, Jol Ouaknine, James Worrell |
| 2012 | Von Neumann's Biased Coin Revisited. | Laurent Bienvenu, Benoit Monin |
| 2012 | A Computational Interpretation of Parametricity. | Jean-Philippe Bernardy, Guilhem Moulin |
| 2012 | Lower Bounds for Existential Pebble Games and k-Consistency Tests. | Christoph Berkholz |
| 2012 | Near Unanimity Constraints Have Bounded Pathwidth Duality. | Libor Barto, Marcin Kozik, Ross Willard |
| 2012 | Graph Logics with Rational Relations and the Generalized Intersection Problem. | Pablo Barcel, Diego Figueira, Leonid Libkin |
| 2012 | Combining Deduction Modulo and Logics of Fixed-Point Definitions. | David Baelde, Gopalan Nadathur |
| 2012 | Inductive Types in Homotopy Type Theory. | Steven Awodey, Nicola Gambino, Kristina Sojakova |
| 2012 | Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics. | Arnon Avron, Beata Konikowska, Anna Zamansky |