This volume presents the proceedings of the First International Static Analysis Symposium (SAS '94), held in Namur, Belgium in September 1994.
The proceedings comprise 25 full refereed papers selected from 70 submissions as well as four invited contributions by Charles Consel, Saumya K. Debray, Thomas W. Getzinger, and Nicolas Halbwachs. The papers address static analysis aspects for various programming paradigms and cover the following topics: generic algorithms for fixpoint computations; program optimization, transformation and verification; strictness-related analyses; type-based analyses and type inference; dependency analyses and abstract domain construction.
Author(s): Thomas W. Getzinger (auth.), Baudouin Le Charlier (eds.)
Series: Lecture Notes in Computer Science 864
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994
Language: English
Pages: 471
Tags: Programming Techniques; Software Engineering; Programming Languages, Compilers, Interpreters; Mathematical Logic and Formal Languages; Logics and Meanings of Programs
The costs and benefits of abstract interpretation-driven Prolog optimization....Pages 1-25
Mode analysis of functional logic programs....Pages 26-42
Directional type checking of logic programs....Pages 43-60
A systematic construction of abstract domains....Pages 61-77
Constraint-based type inference and parametric polymorphism....Pages 78-100
Efficient on-the-fly analysis of program behavior and static cache simulation....Pages 101-115
From processor timing specifications to static instruction scheduling....Pages 116-130
Stackability in the simply-typed call-by-value lambda calculus....Pages 131-146
Generalized boxings, congruences and partial inlining....Pages 147-161
Selective thunkification....Pages 162-178
About synchronous programming and abstract interpretation....Pages 179-192
Uniqueness and completeness analysis of array comprehensions....Pages 193-207
Extent analysis of data fields....Pages 208-222
Verification of linear hybrid systems by means of convex approximations....Pages 223-237
Compile-time detection of uncaught exceptions in Standard ML programs....Pages 238-254
Estimating the computational cost of logic programs....Pages 255-265
Boolean functions for dependency analysis: Algebraic properties and efficient representation....Pages 266-280
Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop....Pages 281-296
Extracting Non-strict independent and-parallelism using sharing and freeness information....Pages 297-313
Efficient fixpoint computation....Pages 314-328
Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration....Pages 329-345
Efficient strictness analysis of Haskell....Pages 346-362
Abstract interpretation using TDGs....Pages 363-379
A type-based framework for program analysis....Pages 380-394
Iterative fixed point computation for type-based strictness analysis....Pages 395-407
Strictness and totality analysis....Pages 408-422
Fast strictness analysis via symbolic fixpoint iteration....Pages 423-431
Generating transformers for deforestation and supercompilation....Pages 432-448
Mechanical elimination of commutative redundancy....Pages 449-463
