3. SAS 1996: Aachen, Germany

Radhia Cousot, David A. Schmidt (Eds.): Static Analysis, Third International Symposium, SAS'96, Aachen, Germany, September 24-26, 1996, Proceedings. Lecture Notes in Computer Science 1145 Springer 1996, ISBN 3-540-61739-6 BibTeX

Guests

Alexander Aiken: Constraint-Based Program Analysis (Abstract). 1 BibTeX
Flemming Nielson: Semantics-Directed Program Analysis: A Tool-Maker's Perspective. 2-21 BibTeX
Bernhard Steffen: Property-Oriented Expansion. 22-41 BibTeX

Contributed Papers

Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup: Generalized Dominators for Structured Programs. 42-51 BibTeX
Martin Alt, Christian Ferdinand, Florian Martin, Reinhard Wilhelm: Cache Behavior Prediction by Abstract Interpretation. 52-66 BibTeX
Peter Holst Andersen, Carsten Kehler Holst: Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language. 67-82 BibTeX
Frank S. de Boer, Maurizio Gabbrielli, Catuscia Palamidessi: Proving Correctness of Constraint Logic Programs with Dynamic Scheduling. 83-97 BibTeX
Roberta Borgia, Pierpaolo Degano, Corrado Priami, Lone Leth, Bent Thomsen: Understanding Mobile Agents via a Non-Interleaving Semantics for Facile. 98-112 BibTeX
Jürgen Brauburger, Jürgen Giesl: Termination Analysis for Partial Functions. 113-127 BibTeX
Maurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers: A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. 128-142 BibTeX
Mario Coppo, Ferruccio Damiani, Paola Giannini: Refinement Types for Program Analysis. 143-158 BibTeX
Lobel Crnogorac, Andrew D. Kelly, Harald Søndergaard: A Comparison of Three Occur-Check Analysers. 159-173 BibTeX
Pavel G. Emeljanov: Analysis of the Equality Relations for the Program Terms. 174-188 BibTeX
Christian Fecht, Helmut Seidl: An Even Faster Solver for General Systems of Equations. 189-204 BibTeX
Robert Givan: Inferring Program Specifications in Polynomial-Time. 205-219 BibTeX
Martin Müller, Thomas Glaß, Karl Stroetmann: Automated Modular Termination Proofs for Real Prolog Programs. 220-237 BibTeX
Hemant D. Pande, Barbara G. Ryder: Data-Flow-Based Virtual Function Resolution. 238-254 BibTeX
Ross Paterson: Compiling Laziness Using Projections. 255-269 BibTeX
Germán Puebla, Manuel V. Hermenegildo: Optimized Algorithms for Incremental Analysis of Logic Programs. 270-284 BibTeX
Jakob Rehof, Torben Æ. Mogensen: Tractable Constraints in Finite Semilattices. 285-300 BibTeX
Olivier Roux, Vlad Rusu: Uniformity for the Decidability of Hybrid Automata. 301-316 BibTeX
Stéphane Schoenig, Mireille Ducassé: A Backward Slicing Algorithm for Prolog. 317-331 BibTeX
Gregor Snelting: Combining Slicing and Constraint Solving for Validation of Measurement Software. 332-348 BibTeX
Valery Trifonov, Scott F. Smith: Subtyping Constrained Types. 349-365 BibTeX
Arnaud Venet: Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs. 366-382 BibTeX

System Descriptions

Maria Handjieva: STAN: A Static Analyzer for CLP(R) Based on Abstract Interpretation. 383-384 BibTeX
Andrew D. Kelly, Kim Marriott, Harald Søndergaard, Peter J. Stuckey: Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs. 385-386 BibTeX
Martin Müller, Thomas Glaß, Karl Stroetmann: PAN - The Prolog Analyzer. 387-388 BibTeX