| 1996 | Generalized Dominators for Structured Programs. | Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup |
| 1996 | Constraint-Based Program Analysis (Abstract). | Alex Aiken |
| 1995 | An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) | Pierre Wolper, Bernard Boigelot |
| 1995 | Binding-Time Analysis and Strictness Analysis by Abstract Interpretation | Franck Vdrine |
| 1995 | Region Inference for Higher-Order Functional Languages | Mads Tofte |
| 1995 | Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell | Julian Seward |
| 1995 | Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages | Manuel Serrano, Pierre Weis |
| 1995 | Natural-Semantics-Based Abstract Interpretation (Preliminary Version) | David A. Schmidt |
| 1995 | Abstract Reduction Using a Tableau Calculus | Manfred Schmidt-Schau, Sven Eric Panitz, Marko Schtz |
| 1995 | Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs | M. R. K. Krishna Rao, R. K. Shyamasundar |
| 1995 | LSign Reordered | Viswanath Ramachandran, Pascal Van Hentenryck |
| 1995 | Trust in the lambda-Calculus | Jens Palsberg, Peter rbk |
| 1995 | IGOR: A Tool for Developing Prolog Dataflow Analyzers | Magnus Nordin, Thomas Lindgren, Hkan Millroth |
| 1995 | Call-By-Name CPS-Translation as a Binding-Time Improvement | Kristian Nielsen, Morten Heine Srensen |
| 1995 | System F and Abstract Interpretation | Bruno Monsuez |
| 1995 | Efficient Closure Utilisation by Higher-Order Inheritance Analysis | Markus Mohnen |
| 1995 | Static Analysis of Communication for Asynchronous Concurrent Programming Languages | Naoki Kobayashi, Motoki Nakade, Akinori Yonezawa |
| 1995 | Effective Flow Analysis for Avoiding Run-Time Checks | Suresh Jagannathan, Andrew K. Wright |
| 1995 | Control-Flow Analysis and Type Systems | Nevin Heintze |
| 1995 | A Type-based Analysis for Stack Allocation in Functional Languages | John Hannan |
| 1995 | Termination Analysis for Functional Programs using Term Orderings | Jrgen Giesl |
| 1995 | GENA - A Tool for Generating Prolog Analyzers from Specifications | Christian Fecht |
| 1995 | Optimizing Lazy Functional Programs Using Flow Inference | Karl-Filip Faxn |
| 1995 | Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time | Dirk Dussart, Fritz Henglein, Christian Mossin |
| 1995 | Complementation in Abstract Interpretation | Agostino Cortesi, Gilberto Fil, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato |