| 2010 | Characterising Space Complexity Classes via Knuth-Bendix Orders. | Guillaume Bonfante, Georg Moser |
| 2010 | ABC: Algebraic Bound Computation for Loops. | Rgis Blanc, Thomas A. Henzinger, Thibaud Hottelier, Laura Kovcs |
| 2010 | Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models. | Jasmin Christian Blanchette, Koen Claessen |
| 2010 | Nitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod. | Jasmin Christian Blanchette |
| 2010 | Verifying Pointer and String Analyses with Region Type Systems. | Lennart Beringer, Robert Grabowski, Martin Hofmann |
| 2010 | Program Logics for Homogeneous Meta-programming. | Martin Berger, Laurence Tratt |
| 2010 | Feasibility as a gradual notion. | Libor Behounek |
| 2010 | On the Equality of Probabilistic Terms. | Gilles Barthe, Marion Daubignard, Bruce M. Kapron, Yassine Lakhnech, Vincent Laporte |
| 2010 | Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation. | Gourinath Banda, John P. Gallagher |
| 2010 | Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. | Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue |
| 2010 | Gdel logics with an operator shifting truth values. | Matthias Baaz, Oliver Fasching |
| 2010 | SAT Encoding of Unification in | Franz Baader, Barbara Morawska |
| 2010 | Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics. | Franz Baader, Marcel Lippmann, Hongkai Liu |
| 2010 | Extended Computation Tree Logic. | Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte |
| 2010 | Boosting Local Search Thanks to cdcl. | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais |
| 2010 | Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces. | Rgis Alenda, Nicola Olivetti |
| 2010 | Playing Lorenzen Dialogue Games on the Web. | Jesse Alama, Sara L. Uckelman |
| 2010 | Proof rules for the dialogical logic N. | Jesse Alama, Sara L. Uckelman |
| 2010 | Exploring Steinitz-Rademacher Polyhedra: a Challenge for Automated Reasoning Tools. | Jesse Alama |
| 2010 | Speed-Up Techniques for Negation in Grounding. | Amir Aavani, Shahab Tasharrofi, Gulay nel, Eugenia Ternovska, David G. Mitchell |
| 2008 | On Bounded Reachability of Programs with Set Comprehensions. | Margus Veanes, Ando Saabas |
| 2008 | Automated Reasoning for Mizar: Artificial Intelligence through Knowledge Exchange. | Josef Urban |
| 2008 | Recurrent Reachability Analysis in Regular Model Checking. | Anthony Widjaja To, Leonid Libkin |
| 2008 | The SZS Ontologies for Automated Reasoning Software. | Geoff Sutcliffe |
| 2008 | A Formalised Lower Bound on Undirected Graph Reachability. | Ulrich Schpp |