| 1991 | Specifying and Proving Serializability in Temporal Logic | Doron A. Peled, Shmuel Katz, Amir Pnueli |
| 1991 | On the 0-1 Law for the class of Existential Second Order Minimal Gdel Sentences with Equality | Leszek Pacholski, Wieslaw Szwast |
| 1991 | Higher-Order Critical Pairs | Tobias Nipkow |
| 1991 | An Evaluation Semantics for Classical Proofs | Chetan R. Murthy |
| 1991 | Predicative Type Universes and Primitive Recursion | Nax Paul Mendler |
| 1991 | Some Results on the Interpretation of lambda-calculus in Operator Algebras | Pasquale Malacaria, Laurent Regnier |
| 1991 | Linearizing Intuitionistic Implication | Patrick Lincoln, Andre Scedrov, Natarajan Shankar |
| 1991 | A Foundational Delineation of Computational Feasiblity | Daniel Leivant |
| 1991 | Games Semantics for Linear Logic | Yves Lafont, Thomas Streicher |
| 1991 | A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events | Dexter Kozen |
| 1991 | Rabin Measures and Their Applications to Fairness and Automata Theory | Nils Klarlund, Dexter Kozen |
| 1991 | A First-Order Theory of Types and Polymorphism in Logic Programming | Michael Kifer, James Wu |
| 1991 | A Computation Model for Executable Higher-Order Algebraic Specification Languages | Jean-Pierre Jouannaud, Mitsuhiro Okada |
| 1991 | Specification and Refinement of Probabilistic Processes | Bengt Jonsson, Kim Guldstrand Larsen |
| 1991 | Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes | Hans Httel, Colin Stirling |
| 1991 | Semantics of Pointers, Referencing and Dereferencing with Intensional Logic | Hing-Kai Hung, Jeffery I. Zucker |
| 1991 | Complexity Bounds of Hoare-style Proof Systems | Hardi Hungar |
| 1991 | On Computational Open-Endedness in Martin-Lf's Type Theory | Douglas J. Howe |
| 1991 | Logic Programming in a Fragment of Intuitionistic Linear Logic | Joshua S. Hodas, Dale Miller |
| 1991 | A Partial Approach to Model Checking | Patrice Godefroid, Pierre Wolper |
| 1991 | Logic Programs as Types for Logic Programs | Thom W. Frhwirth, Ehud Shapiro, Moshe Y. Vardi, Eyal Yardeni |
| 1991 | Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis | Agostino Cortesi, Gilberto Fil, William H. Winsborough |
| 1991 | A Theory of Testing for Real-Time | Rance Cleaveland, Amy E. Zwarico |
| 1991 | CCS with Priority Choice | Juanito Camilleri, Glynn Winskel |
| 1991 | Sequentiality and Strong Stability | Antonio Bucciarelli, Thomas Ehrhard |