| 2010 | On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. | Manuel Bodirsky, Martin Hils, Barnaby Martin |
| 2010 | Infinitary Completeness in Ludics. | Michele Basaldella, Kazushige Terui |
| 2010 | A Calculus of Contracting Processes. | Massimo Bartoletti, Roberto Zunino |
| 2010 | New Conditions for Taylor Varieties and CSP. | Libor Barto, Marcin Kozik |
| 2010 | The Emptiness Problem for Tree Automata with Global Constraints. | Luis Bargu, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher |
| 2010 | Querying the Guarded Fragment. | Vince Brny, Georg Gottlob, Martin Otto |
| 2010 | On Strong Maximality of Paraconsistent Finite-Valued Logics. | Arnon Avron, Ofer Arieli, Anna Zamansky |
| 2010 | Probabilistic Information Flow. | Mrio S. Alvim, Miguel E. Andrs, Catuscia Palamidessi |
| 2010 | Coalgebras, Chu Spaces, and Representations of Physical Systems. | Samson Abramsky |
| 2010 | The Fine Print of Security. | Martn Abadi |
| 2009 | Graph Reachability and Pebble Automata over Infinite Alphabets. | Tony Tan |
| 2009 | Statistic Analysis for Probabilistic Processes. | Michel de Rougemont, Mathieu Tracol |
| 2009 | Combining Ehrenfeucht-Frass Games. | Benjamin Rossman |
| 2009 | Substructural Operational Semantics as Ordered Logic Programming. | Frank Pfenning, Robert J. Simmons |
| 2009 | The Inverse Taylor Expansion Problem in Linear Logic. | Michele Pagani, Christine Tasson |
| 2009 | Functional Reachability. | C.-H. Luke Ong, Nikos Tzevelekos |
| 2009 | Trace Semantics is Fully Abstract. | Sumit Nain, Moshe Y. Vardi |
| 2009 | The Structure of First-Order Causality. | Samuel Mimram |
| 2009 | The Complexity of Positive First-order Logic without Equality. | Florent R. Madelaine, Barnaby Martin |
| 2009 | A Unified Sequent Calculus for Focused Proofs. | Chuck C. Liang, Dale Miller |
| 2009 | The General Vector Addition System Reachability Problem by Presburger Inductive Invariants. | Jrme Leroux |
| 2009 | Dinatural Terms in System F. | Joachim De Lataillade |
| 2009 | A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. | Naoki Kobayashi, C.-H. Luke Ong |
| 2009 | On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations. | Emanuel Kieronski, Lidia Tendera |
| 2009 | A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. | Yevgeny Kazakov, Ian Pratt-Hartmann |