| 1997 | Practical Compile-Time Analysis. | Barbara G. Ryder |
| 1997 | On Sparse Evaluation Representations. | G. Ramalingam |
| 1997 | TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. | Sven Eric Panitz, Manfred Schmidt-Schau |
| 1997 | Exact Flow Analysis. | Christian Mossin |
| 1997 | Abstract Interpretation: A Theory of Approximate Computation. | Kim Marriott |
| 1997 | Static Analysis of Interaction Nets for Distributed Implementations. | Ian Mackie |
| 1997 | Combining Abstract Interpretation and Partial Evaluation (Brief Overview). | Neil D. Jones |
| 1997 | Type-Directed Flow Analysis for Typed Intermediate Languages. | Suresh Jagannathan, Stephen Weeks, Andrew K. Wright |
| 1997 | Type-Based Analysis of Communication for Concurrent Programming Languages. | Atsushi Igarashi, Naoki Kobayashi |
| 1997 | Effective Specialization of Realistic Programs via Use Sensitivity. | Luke Hornof, Charles Consel, Jacques Noy |
| 1997 | Can Abstract Interpretation Become a Mainstream Compiler Technology? (Abstract). | Luddy Harrison |
| 1997 | Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract). | Philippe Granger |
| 1997 | Satisfying Subtype Inequalities in Polynomial Space. | Alexandre Frey |
| 1997 | Program Analysis Using Mixed Term and Set Constraints. | Manuel Fhndrich, Alexander Aiken |
| 1997 | Semantic Analyzer of Modula-Programs. | Pavel G. Emelianov, Danil E. Baburin |
| 1997 | Abstract Interpretation Based Static Analysis Parameterized by Semantics. | Patrick Cousot |
| 1997 | Attribute Grammars and Functional Programming Deforestation. | Loc Correnson, tienne Duris, Didier Parigot, Gilles Roussel |
| 1997 | An Algebraic Approach to Sharing Analysis of Logic Programs. | Michael Codish, Vitaly Lagoon, Francisco Bueno |
| 1997 | On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract). | Baudouin Le Charlier, Pierre Flener |
| 1997 | Automatic Termination Analysis for Partial Functions Using Polynomial Orderings. | Jrgen Brauburger |
| 1997 | The Power of QDDs (Extended Abstract). | Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper |
| 1997 | True Concurrency via Abstract Interpretation. | Chiara Bodei, Corrado Priami |
| 1997 | Abstract Interpretation from Improving WAM Code. | Dante Baldan, Gilberto Fil |
| 1997 | Set-Sharing is Redundant for Pair-Sharing. | Roberto Bagnara, Patricia M. Hill, Enea Zaffanella |
| 1996 | Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs. | Arnaud Venet |