| 1992 | A Calculus of Dataflow Networks (Extended Abstract) Eugene W. Stark |
| 1992 | A Computational Analysis of Girard's Translation and LC Chetan R. Murthy |
| 1992 | A Constructive Formalization of the Catch and Throw Mechanism Hiroshi Nakano |
| 1992 | An Engine for Logic Program Analysis Nevin Heintze, Joxan Jaffar |
| 1992 | An abstract standardisation theorem Georges Gonthier, Jean-Jacques Lévy, Paul-André Melliès |
| 1992 | Asynchronous Communication in Process Algebra Frank S. de Boer, Jan Willem Klop, Catuscia Palamidessi |
| 1992 | Axiomatizable Classes of Finite Models and Definability of Linear Order Alexei P. Stolboushkin |
| 1992 | Compiler Verification in LF John Hannan, Frank Pfenning |
| 1992 | Cutting Planes and constant depth Frege proofs Peter Clote |
| 1992 | Decidable Problems in Shallow Equational Theories (Extended Abstract) Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud |
| 1992 | Deterministic vs. Nondeterministic Transitive Closure Logic Erich Grädel, Gregory L. McColm |
| 1992 | Disjunctive Strictness Analysis Thomas P. Jensen |
| 1992 | Double-exponential Complexity of Computing a Complete Set of AC-Unifiers Deepak Kapur, Paliath Narendran |
| 1992 | Equivalences on Observable Processes Irek Ulidowski |
| 1992 | Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory Phokion G. Kolaitis, Moshe Y. Vardi |
| 1992 | Functorial Parametricity Peter J. Freyd, Edmund P. Robinson, Giuseppe Rosolini |
| 1992 | Generalized Quantifiers and Pebble Games on Finite Structures Phokion G. Kolaitis, Jouko A. Väänänen |
| 1992 | Horn Programming in Linear Logic Is NP-Complete Max I. Kanovich |
| 1992 | Linear Logic Without Boxes Georges Gonthier, Martín Abadi, Jean-Jacques Lévy |
| 1992 | Logical Hierarchies in PTIME Lauri Hella |
| 1992 | Minimal Model Semantics for Nonmonotonic Modal Logics Grigori Schwarz |
| 1992 | Mixing List Recursion and Arithmetic Laurent Fribourg |
| 1992 | Monadic Theory of Term Rewritings Didier Caucal |
| 1992 | New Foundations for the Geometry of Interaction Samson Abramsky, Radha Jagadeesan |
| 1992 | Observable Algorithms on Concrete Data Structures Pierre-Louis Curien |
| 1992 | Operational aspects of linear lambda calculus Patrick Lincoln, John C. Mitchell |
| 1992 | Origins of the Calculus of Binary Relations Vaughan R. Pratt |
| 1992 | Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), Santa Cruz, California, USA, June 22-25, 1992 |
| 1992 | Progress Measures, Immediate Determinacy, and a Subset Construction for Tree Automata Nils Klarlund |
| 1992 | Random Worlds and Maximum Entropy Adam J. Grove, Joseph Y. Halpern, Daphne Koller |
| 1992 | References, Local Variables and Operational Reasoning Ian A. Mason, Carolyn L. Talcott |
| 1992 | Retracts in simply typed lambda-beta-eta-calculus Ugo de'Liguoro, Adolfo Piperno, Richard Statman |
| 1992 | Solving Systems of Set Constraints (Extended Abstract) Alexander Aiken, Edward L. Wimmers |
| 1992 | Specification in Software Development Jeannette M. Wing |
| 1992 | Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems Yoshihito Toyama |
| 1992 | Subtype Inequalities Jerzy Tiuryn |
| 1992 | Symbolic Model Checking for Real-time Systems Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine |
| 1992 | The Category of Constraint Systems is Cartesian-Closed Vijay A. Saraswat |
| 1992 | The Church-Rosser Property for beta-eta-reduction in Typed lambda-Calculi Herman Geuvers |
| 1992 | The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract) Davide Sangiorgi |
| 1992 | The Type and Effect Discipline Jean-Pierre Talpin, Pierre Jouvelot |
| 1992 | There is No Recursive Axiomatization for Feasible Functionals of Type~2 Anil Seth |
| 1992 | Third Order Matching is Decidable Gilles Dowek |
| 1992 | Turning SOS Rules into Equations Luca Aceto, Bard Bloom, Frits W. Vaandrager |
| 1992 | Zero-One Laws for Modal Logic Joseph Y. Halpern, Bruce M. Kapron |