| 2002 | Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. | Ulrich Schpp, Alex K. Simpson |
| 2002 | A Calculus of Circular Proofs and Its Categorical Semantics. | Luigi Santocanale |
| 2002 | Notions of Computation Determine Monads. | Gordon D. Plotkin, John Power |
| 2002 | Heterogeneous Development Graphs and Heterogeneous Borrowing. | Till Mossakowski |
| 2002 | The Informatic Derivative at a Compact Element. | Keye Martin |
| 2002 | Bounded MSC Communication. | Markus Lohrey, Anca Muscholl |
| 2002 | Model-Checking Infinite Systems Generated by Ground Tree Rewriting. | Christof Lding |
| 2002 | On Model Checking Durational Kripke Structures. | Franois Laroussinie, Nicolas Markey, Philippe Schnoebelen |
| 2002 | Model Checking Fixed Point Logic with Chop. | Martin Lange, Colin Stirling |
| 2002 | Logics Admitting Final Semantics. | Alexander Kurz |
| 2002 | Conflict Detection and Resolution in Access Control Policy Specifications. | Manuel Koch, Luigi V. Mancini, Francesco Parisi-Presicce |
| 2002 | Higher-Order Pushdown Trees Are Easy. | Teodor Knapik, Damian Niwinski, Pawel Urzyczyn |
| 2002 | Efficient Type Matching. | Somesh Jha, Jens Palsberg, Tian Zhao |
| 2002 | Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. | Petr Jancar, Antonn Kucera, Faron Moller, Zdenek Sawa |
| 2002 | A Characterization of Families of Graphs in Which Election Is Possible. | Emmanuel Godard, Yves Mtivier |
| 2002 | Varieties of Effects. | Carsten Fhrmann |
| 2002 | Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation. | Gian-Luigi Ferrari, Ugo Montanari, Marco Pistore |
| 2002 | The Demonic Product of Probabilistic Relations. | Ernst-Erich Doberkat |
| 2002 | A First-Order One-Pass CPS Transformation. | Olivier Danvy, Lasse R. Nielsen |
| 2002 | Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations. | Bruno Courcelle |
| 2002 | On Specification Logics for Algebra-Coalgebra Structures: Reconciling Reachability and Observability. | Corina Crstea |
| 2002 | On Compositional Reasoning in the Spi-calculus. | Michele Boreale, Daniele Gorla |
| 2002 | Generalised Regular MSC Languages. | Benedikt Bollig, Martin Leucker, Thomas Noll |
| 2002 | Proving Correctness of Timed Concurrent Constraint Programs. | Frank S. de Boer, Maurizio Gabbrielli, Maria Chiara Meo |
| 2002 | On the Integration of Observability and Reachability Concepts. | Michel Bidoit, Rolf Hennicker |