| 2002 | Complete Problems for Dynamic Complexity Classes. | William Hesse, Neil Immerman |
| 2002 | A Syntactic Approach to Foundational Proof-Carrying Code. | Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, Zhaozhong Ni |
| 2002 | Monadic Queries over Tree-Structured Data. | Georg Gottlob, Christoph Koch |
| 2002 | Semantic Subtyping. | Alain Frisch, Giuseppe Castagna, Vronique Benzaken |
| 2002 | The Complexity of First-Order and Monadic Second-Order Logic Revisited. | Markus Frick, Martin Grohe |
| 2002 | Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types. | Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat |
| 2002 | Dense Real-Time Games. | Marco Faella, Salvatore La Torre, Aniello Murano |
| 2002 | Domain Theory and Differential Calculus (Functions of one Variable). | Abbas Edalat, Andr Lieutier |
| 2002 | Computing Reachability Relations in Timed Automata. | Catalin Dima |
| 2002 | The Metric Analogue of Weak Bisimulation for Probabilistic Processes. | Jose Desharnais, Radha Jagadeesan, Vineet Gupta, Prakash Panangaden |
| 2002 | Complexity Classes, Propositional Proof Systems, and Formal Theories. | Stephen A. Cook |
| 2002 | Tree-Like Counterexamples in Model Checking. | Edmund M. Clarke, Somesh Jha, Yuan Lu, Helmut Veith |
| 2002 | Description Logics: Foundations for Class-based Knowledge Representation. | Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini |
| 2002 | Tree Extension Algebras: Logics, Automata, and Query Languages. | Michael Benedikt, Leonid Libkin |
| 2002 | The 0-1 law fails for frame satisfiability of propositional modal logic. | Jean-Marie Le Bars |
| 2002 | Unsatisfiable Random Formulas Are Hard to Certify. | Albert Atserias |
| 2002 | A Stratified Semantics of General References A Stratified Semantics of General References. | Amal J. Ahmed, Andrew W. Appel, Roberto Virga |
| 2001 | Strong Normalisation in the pi-Calculus. | Nobuko Yoshida, Martin Berger, Kohei Honda |
| 2001 | Dependent Types for Program Termination Verification. | Hongwei Xi |
| 2001 | The Engineering Challenge for Logic. | Wolfgang Thomas |
| 2001 | Light Affine Calculus and Polytime Strong Normalization. | Kazushige Terui |
| 2001 | On the Decision Problem for the Guarded Fragment with Transitivity. | Wieslaw Szwast, Lidia Tendera |
| 2001 | A Decision Procedure for an Extensional Theory of Arrays. | Aaron Stump, Clark W. Barrett, David L. Dill, Jeremy R. Levitt |
| 2001 | A Bound on Attacks on Payment Protocols. | Scott D. Stoller |
| 2001 | A Continuum of Theories of Lambda Calculus without Semantics. | Antonino Salibra |