+612 9045 4394
 
CHECKOUT
Static Analysis : 4th International Symposium, SAS '97, Paris, France, September 8-10, 1997, Proceedings - Pascal Van Hentenryck

Static Analysis

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

By: Pascal Van Hentenryck (Editor)

Paperback

Published: 27th August 1997
Ships: 5 to 9 business days
5 to 9 business days
$135.51
or 4 easy payments of $33.88 with Learn more

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.

On Sparse Evaluation Representationsp. 1
The Effects of the Precision of Pointer Analysisp. 16
Fast and Effective Procedure Inliningp. 35
Set Sharing is Redundant for Pair-Sharingp. 53
An Algebraic Approach to Sharing Analysis of Logic Programsp. 68
Logical Optimality of Groundness Analysisp. 83
Toward a Cost-Effective Estimation of Uncaught Exceptions in SML Programsp. 98
Program Analysis using Mixed Term and Set Constraintsp. 114
Set-Based Analysis for Logic Programming and Tree Automatap. 127
Denotational Abstract Interpretation of Functional Logic Programsp. 141
Termination Analysis for Mercuryp. 160
The Power of QDDsp. 172
Type-Based Analysis of Communication for Concurrent Programming Languagesp. 187
True Concurrency via Abstract Interpretationp. 202
Static Analysis of Interaction Nets for Distributed Implementationsp. 217
Type-Directed Flow Analysis for Typed Intermediate Languagesp. 232
Exact Flow Analysisp. 250
Satisfying Subtype Inequalities in Polynomial Spacep. 265
Static Analyses of Congruence Properties on Rational Numbersp. 278
Effective Specialization of Realistic Programs via Use Sensitivityp. 293
Coalescing Conditional Branches into Efficient Indirect Jumpsp. 319
Automatic Termination Analysis for Partial Functions Using Polynomial Orderingsp. 330
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-order Functional Languagep. 345
Semantic Analyzer of Modula-Programsp. 361
Abstract Interpretation for Improving WAM Codep. 364
Attribute Grammars and Functional Programming Deforestationp. 365
Data Dependences as Abstract Interpretationp. 366
Abstract Interpretation: A Theory of Approximate Computationp. 367
On the Desirable Link Between Theory and Practice in Abstract Interpretationp. 379
Abstract Interpretation Based Static Analysis Parameterized by Semanticsp. 388
Can Abstract Interpretation become a Mainstream Compiler Technology?p. 395
Combining Abstract Interpretation and Partial Evaluationp. 396
Practical Compile-Time Analysisp. 406
Author Indexp. 413
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540634683
ISBN-10: 3540634681
Series: Lecture Notes in Computer Science,
Audience: General
Format: Paperback
Language: English
Number Of Pages: 424
Published: 27th August 1997
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.24
Weight (kg): 0.6