Static Analysis: First International Static Analysis Symposium, SAS '94, Namur, Belgium, September 28 - 30, 1994. Proceedings

by Baudouin LeCharlier (Editor)

Overview

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.

Product Details

ISBN-13:	9783540584858
Publisher:	Springer Berlin Heidelberg
Publication date:	10/21/1994
Series:	Lecture Notes in Computer Science , #864
Edition description:	1994
Pages:	471
Product dimensions:	6.10(w) x 9.17(h) x 0.04(d)

Table of Contents

The costs and benefits of abstract interpretation-driven Prolog optimization.- Mode analysis of functional logic programs.- Directional type checking of logic programs.- A systematic construction of abstract domains.- Constraint-based type inference and parametric polymorphism.- Efficient on-the-fly analysis of program behavior and static cache simulation.- From processor timing specifications to static instruction scheduling.- Stackability in the simply-typed call-by-value lambda calculus.- Generalized boxings, congruences and partial inlining.- Selective thunkification.- About synchronous programming and abstract interpretation.- Uniqueness and completeness analysis of array comprehensions.- Extent analysis of data fields.- Verification of linear hybrid systems by means of convex approximations.- Compile-time detection of uncaught exceptions in Standard ML programs.- Estimating the computational cost of logic programs.- Boolean functions for dependency analysis: Algebraic properties and efficient representation.- Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop.- Extracting Non-strict independent and-parallelism using sharing and freeness information.- Efficient fixpoint computation.- Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration.- Efficient strictness analysis of Haskell.- Abstract interpretation using TDGs.- A type-based framework for program analysis.- Iterative fixed point computation for type-based strictness analysis.- Strictness and totality analysis.- Fast strictness analysis via symbolic fixpoint iteration.- Generating transformers for deforestation and supercompilation.- Mechanical elimination of commutative redundancy.