| 1997 | A Kleene Theorem for Timed Automata. Eugene Asarin, Paul Caspi, Oded Maler |
| 1997 | A Logic for Reasoning with Higher-Order Abstract Syntax. Raymond McDowell, Dale Miller |
| 1997 | A Partially Deadlock-Free Typed Process Calculus. Naoki Kobayashi |
| 1997 | A Relational Account of Call-by-Value Sequentiality. Jon G. Riecke, Anders Sandholm |
| 1997 | An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. P. S. Thiagarajan, Igor Walukiewicz |
| 1997 | Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices. David Janin |
| 1997 | Automata-Driven Automated Induction. Adel Bouhoula, Jean-Pierre Jouannaud |
| 1997 | Believe it or not, AJM's Games Model is a Model of Classical Linear Logic. Patrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier |
| 1997 | Bisimulation for Labelled Markov Processes. Richard Blute, Josée Desharnais, Abbas Edalat, Prakash Panangaden |
| 1997 | Boolean Expression Diagrams (Extended Abstract). Henrik Reif Andersen, Henrik Hulgaard |
| 1997 | Combination of Compatible Reduction Orderings that are Total on Ground Terms. Franz Baader |
| 1997 | Complete Cuboidal Sets in Axiomatic Domain Theory. Marcelo P. Fiore, Gordon D. Plotkin, A. John Power |
| 1997 | Complexity of Power Default Reasoning. Guo-Qiang Zhang, William C. Rounds |
| 1997 | Complexity of Two-Variable Logic with Counting. Leszek Pacholski, Wieslaw Szwast, Lidia Tendera |
| 1997 | Continuation Models are Universal for Lambda-Mu-Calculus. Martin Hofmann, Thomas Streicher |
| 1997 | Discrimination by Parallel Observers. Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn |
| 1997 | First-Order Logic with Two Variables and Unary Temporal Logic. Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
| 1997 | Full Abstraction for Functional Languages with Control. James Laird |
| 1997 | Games and Definability for System F. Dominic J. D. Hughes |
| 1997 | Ground Reducibility is EXPTIME-Complete. Hubert Comon, Florent Jacquemard |
| 1997 | How Much Memory is Needed to Win Infinite Games? Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz |
| 1997 | Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras. Martín Hötzel Escardó, Thomas Streicher |
| 1997 | Large Finite Structures with Few L Martin Grohe |
| 1997 | Linear Higher-Order Pre-Unification. Iliano Cervesato, Frank Pfenning |
| 1997 | On the Complexity of Reasoning in Kleene Algebra. Dexter Kozen |
| 1997 | On the Cubic Bottleneck in Subtyping and Flow Analysis. Nevin Heintze, David A. McAllester |
| 1997 | On the Forms of Locality over Finite Models. Leonid Libkin |
| 1997 | Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997 |
| 1997 | Quantitative Analysis and Model Checking. Michael Huth, Marta Z. Kwiatkowska |
| 1997 | Ramified Higher-Order Unification. Jean Goubault-Larrecq |
| 1997 | Semantics of Exact Real Arithmetic. Peter John Potts, Abbas Edalat, Martín Hötzel Escardó |
| 1997 | Set Constraints with Intersection. Witold Charatonik, Andreas Podelski |
| 1997 | Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract). Roberto Di Cosmo, Delia Kesner |
| 1997 | Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract). Max I. Kanovich, Takayasu Ito |
| 1997 | The "Hardest" Natural Decidable Theory. Sergei G. Vorobyov |
| 1997 | The Complexity of Subtype Entailment for Simple Types. Fritz Henglein, Jakob Rehof |
| 1997 | The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. Oliver Matz, Wolfgang Thomas |
| 1997 | Towards a Mathematical Operational Semantics. Daniele Turi, Gordon D. Plotkin |
| 1997 | Two-Variable Logic with Counting is Decidable. Erich Grädel, Martin Otto, Eric Rosen |
| 1997 | Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract). Julian Rathke |