| 2002 | Verification for Java's Reentrant Multithreading Concept. | Erika brahm-Mumm, Frank S. de Boer, Willem P. de Roever, Martin Steffen |
| 2001 | An Axiomatic Semantics for the Synchronous Language Gentzen. | Simone Tini |
| 2001 | Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. | Colin Stirling |
| 2001 | Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts. | Christine Rckl, Daniel Hirschkoff, Stefan Berghofer |
| 2001 | Adequacy for Algebraic Effects. | Gordon D. Plotkin, John Power |
| 2001 | Verified Bytecode Verifiers. | Tobias Nipkow |
| 2001 | On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. | Rmi Morin |
| 2001 | Model Checking CTL | Franois Laroussinie, Nicolas Markey, Philippe Schnoebelen |
| 2001 | Categories of Processes Enriched in Final Coalgebras. | Sava Krstic, John Launchbury, Dusko Pavlovic |
| 2001 | Foundations for a Graph-Based Approach to the Specification of Access Control Policies. | Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce |
| 2001 | On the Complexity of Parity Word Automata. | Valerie King, Orna Kupferman, Moshe Y. Vardi |
| 2001 | Class Analysis of Object-Oriented Programs through Abstract Interpretation. | Thomas P. Jensen, Fausto Spoto |
| 2001 | Axioms for Recursion in Call-by-Value. | Masahito Hasegawa, Yoshihiko Kakutani |
| 2001 | Computational Completeness of Programming Languages Based on Graph Transformation. | Annegret Habel, Detlef Plump |
| 2001 | Synchronized Tree Languages Revisited and New Applications. | Valrie Gouranton, Pierre Rty, Helmut Seidl |
| 2001 | On the Modularity of Deciding Call-by-Need. | Irne Durand, Aart Middeldorp |
| 2001 | Type Inference with Recursive Type Equations. | Mario Coppo |
| 2001 | The Rho Cube. | Horatiu Cirstea, Claude Kirchner, Luigi Liquori |
| 2001 | The Complexity of Model Checking Mobile Ambients. | Witold Charatonik, Silvano Dal-Zilio, Andrew D. Gordon, Supratik Mukhopadhyay, Jean-Marc Talbot |
| 2001 | On Garbage and Program Logic. | Cristiano Calcagno, Peter W. O'Hearn |
| 2001 | Temporary Data in Shared Dataspace Coordination Languages. | Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro |
| 2001 | High-Level Petri Nets as Type Theories in the Join Calculus. | Maria Grazia Buscemi, Vladimiro Sassone |
| 2001 | The Finite Graph Problem for Two-Way Alternating Automata. | Mikolaj Bojanczyk |
| 2001 | On the Duality between Observability and Reachability. | Michel Bidoit, Rolf Hennicker, Alexander Kurz |
| 2001 | Type Isomorphisms and Proof Reuse in Dependent Type Theory. | Gilles Barthe, Olivier Pons |