This book constitutes the refereed proceedings of the Third International Static Analysis Symposium, SAS '96, held in Aachen, Germany, in September 1996 in conjunction with ALP and PLILP.
The volume presents 22 highly-quality revised full papers selected from a total of 79 submissions; also included are three system descriptions and invited contributions by Alex Aiken (abstract only), Flemming Nielson, and Bernhard Steffen. Among the topics addressed are program analysis, incremental analysis, abstract interpretation, partial evaluation, logic programming, functional programming, and constraint programming.
Author(s): Alex Aiken (auth.), Radhia Cousot, David A. Schmidt (eds.)
Series: Lecture Notes in Computer Science 1145
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996
Language: English
Pages: 398
Tags: Programming Techniques; Software Engineering; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
Constraint-based program analysis....Pages 1-1
Semantics-directed program analysis: A tool-maker's perspective....Pages 2-21
Property-oriented expansion....Pages 22-41
Generalized dominators for structured programs....Pages 42-51
Cache behavior prediction by abstract interpretation....Pages 52-66
Termination analysis for offline partial evaluation of a higher order functional language....Pages 67-82
Proving correctness of Constraint Logic Programs with dynamic scheduling....Pages 83-97
Understanding mobile agents via a non-interleaving semantics for facile....Pages 98-112
Termination analysis for partial functions....Pages 113-127
A freeness and sharing analysis of logic programs based on a pre-interpretation....Pages 128-142
Refinement types for program analysis....Pages 143-158
A comparison of three occur-check analysers....Pages 159-173
Analysis of the equality relations for the program terms....Pages 174-188
An even faster solver for general systems of equations....Pages 189-204
Inferring program specifications in polynomial-time....Pages 205-219
Automated modular termination proofs for real Prolog programs....Pages 220-237
Data-flow-based virtual function resolution....Pages 238-254
Compiling laziness using projections....Pages 255-269
Optimized algorithms for incremental analysis of logic programs....Pages 270-284
Tractable constraints in finite semilattices....Pages 285-300
Uniformity for the decidability of hybrid automata....Pages 301-316
A backward slicing algorithm for Prolog....Pages 317-331
Combining slicing and constraint solving for validation of measurement software....Pages 332-348
Subtyping constrained types....Pages 349-365
Abstract cofibered domains: Application to the alias analysis of untyped programs....Pages 366-382
Stan: A static analyzer for CLP({ie383-01}) based on abstract interpretation....Pages 383-384
Two applications of an incremental analysis engine for (constraint) logic programs....Pages 385-386
PAN — The Prolog analyzer....Pages 387-388
