This book constitutes the refereed proceedings of the Second International Symposium on Static Analysis, SAS '95, held in Glasgow, UK, in September 1995. Static Analysis is increasingly recognized as a foundation for high-performance implementations and verification systems of high-level programming languages.
22 full revised papers selected from a total of 55 submissions are presented; they address static analysis issues for different programming paradigms; in particular concurrent, constraint, functional, imperative, logic, and object-oriented programming are addressed. In addition there are abstracts or full papers for three invited presentations and two system descriptions.
Author(s): David A. Schmidt (auth.), Alan Mycroft (eds.)
Series: Lecture Notes in Computer Science 983
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995
Language: English
Pages: 431
Tags: Programming Techniques; Software Engineering; Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
Natural-semantics-based abstract interpretation (preliminary version)....Pages 1-18
Region inference for higher-order functional languages....Pages 19-20
An automata-theoretic approach to Presburger arithmetic constraints....Pages 21-32
Generation of efficient interprocedural analyzers with PAG....Pages 33-50
Optimality in abstractions of model checking....Pages 51-63
Determining storage properties of sequential and concurrent programs with assignment and structured data....Pages 64-81
Partitioning non-strict functional languages for multi-threaded code generation....Pages 82-99
Complementation in abstract interpretation....Pages 100-117
Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time....Pages 118-135
Optimizing lazy functional programs using flow inference....Pages 136-153
Termination analysis for functional programs using term orderings....Pages 154-171
A type-based analysis for stack allocation in functional languages....Pages 172-188
Control-flow analysis and type systems....Pages 189-206
Effective flow analysis for avoiding run-time checks....Pages 207-224
Static analysis of communication for asynchronous concurrent programming languages....Pages 225-242
Unification-free execution of well-moded and well-typed Prolog programs....Pages 243-260
Efficient closure utilisation by higher-order inheritance analysis....Pages 261-278
System F and abstract interpretation....Pages 279-295
Call-by-name CPS-translation as a binding-time improvement....Pages 296-313
Trust in the λ-calculus....Pages 314-329
LSign reordered....Pages 330-347
Strictness analysis by abstract reduction using a tableau calculus....Pages 348-365
Bigloo: a portable and optimizing compiler for strict functional languages....Pages 366-381
Beyond prototype implementations: Polymorphic projection analysis for Glasgow Haskell....Pages 382-399
Binding-time analysis and strictness analysis by abstract interpretation....Pages 400-417
GENA — A tool for generating Prolog analyzers from specifications....Pages 418-419
IGOR: A tool for developing Prolog dataflow analyzers....Pages 420-421
