Del 1302 - Lecture Notes in Computer Science

Static Analysis

4th International Symposium, SAS '97, Paris, France, September 8-10, 1997, Proceedings

Häftad, Engelska, 1997

Av Pascal Van Hentenryck, Pascal Van Hentenryck, Pascal van Hentenryck

729 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1997-08-27
Mått216 x 279 x 24 mm
Vikt651 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor424
Upplaga1997
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540634683

Tillhör följande kategorier

On sparse evaluation representations.- The effects of the precision of pointer analysis.- Fast and effective procedure inlining.- Set-sharing is redundant for pair-sharing.- An algebraic approach to sharing analysis of logic programs.- Logical optimality of groundness analysis.- Towards a cost-effective estimation of uncaught exceptions in SML programs.- Program analysis using mixed term and set constraints.- Set-based analysis for logic programming and tree automata.- Denotational abstract interpretation of functional logic programs.- Termination analysis for Mercury.- The power of QDDs (extended abstract).- Type-based analysis of communication for concurrent programming languages.- True concurrency via abstract interpretation.- Static analysis of interaction nets for distributed implementations.- Type-directed flow analysis for typed intermediate languages.- Exact flow analysis.- Satisfying subtype inequalities in polynomial space.- Static analyses of congruence properties on rational numbers (extended abstract).- Effective specialization of realistic programs via use sensitivity.- Coalescing conditional branches into efficient indirect jumps.- Automatic termination analysis for partial functions using polynomial orderings.- TEA: Automatically proving termination of programs in a non-strict higher-order functional language.- Semantic analyzer of modula-programs.- Abstract interpretation for improving WAM code.- Attribute grammars and functional programming deforestation.- Data dependences as abstract interpretations.- Abstract interpretation: A theory of approximate computation.- On the desirable link between theory and practice in abstract interpretation (extended abstract).- Abstract interpretation based static analysis parameterized by semantics.- Can abstract interpretation become a mainstream compiler technology?.- Combining abstract interpretation and partial evaluation (brief overview).- Practical compile-time analysis.