This book presents the refereed proceedings of the 4th International Symposium on Static Analysis, SAS '97, held in Paris, France, in September 1997.
The 23 revised papers were selected from 61 high-quality submissions on the basis of at least three reviews. Also included are one system demonstration, three posters, and six invited contributions by leading scientists. The papers are organized in topical sections on procedural languages, logic programming, concurrency, and termination.
Author(s): G. Ramalingam (auth.), Pascal Van Hentenryck (eds.)
Series: Lecture Notes in Computer Science 1302
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997
Language: English
Pages: 424
Tags: Logics and Meanings of Programs; Programming Techniques; Software Engineering; Programming Languages, Compilers, Interpreters; Mathematical Logic and Formal Languages
On sparse evaluation representations....Pages 1-15
The effects of the precision of pointer analysis....Pages 16-34
Fast and effective procedure inlining....Pages 35-52
Set-sharing is redundant for pair-sharing....Pages 53-67
An algebraic approach to sharing analysis of logic programs....Pages 68-82
Logical optimality of groundness analysis....Pages 83-97
Towards a cost-effective estimation of uncaught exceptions in SML programs....Pages 98-113
Program analysis using mixed term and set constraints....Pages 114-126
Set-based analysis for logic programming and tree automata....Pages 127-140
Denotational abstract interpretation of functional logic programs....Pages 141-156
Termination analysis for Mercury....Pages 157-171
The power of QDDs (extended abstract)....Pages 172-186
Type-based analysis of communication for concurrent programming languages....Pages 187-201
True concurrency via abstract interpretation....Pages 202-216
Static analysis of interaction nets for distributed implementations....Pages 217-231
Type-directed flow analysis for typed intermediate languages....Pages 232-249
Exact flow analysis....Pages 250-264
Satisfying subtype inequalities in polynomial space....Pages 265-277
Static analyses of congruence properties on rational numbers (extended abstract)....Pages 278-292
Effective specialization of realistic programs via use sensitivity....Pages 293-314
Coalescing conditional branches into efficient indirect jumps....Pages 315-329
Automatic termination analysis for partial functions using polynomial orderings....Pages 330-344
TEA: Automatically proving termination of programs in a non-strict higher-order functional language....Pages 345-360
Semantic analyzer of modula-programs....Pages 361-363
Abstract interpretation for improving WAM code....Pages 364-364
Attribute grammars and functional programming deforestation....Pages 365-365
Data dependences as abstract interpretations....Pages 366-366
Abstract interpretation: A theory of approximate computation....Pages 367-378
On the desirable link between theory and practice in abstract interpretation (extended abstract)....Pages 379-387
Abstract interpretation based static analysis parameterized by semantics....Pages 388-394
Can abstract interpretation become a mainstream compiler technology?....Pages 395-395
Combining abstract interpretation and partial evaluation (brief overview)....Pages 396-405
Practical compile-time analysis....Pages 406-412
