Static Analysis: 5th International Symposium, Sas'98, Pisa, Italy, September 14-16, 1998, Proceedings

ISBN-13: 9783540650140 / Angielski / Miękka / 1998 / 394 str.

G. Ional Levi; Giorgio Levi; J. Hartmanis

Opis

This text constitutes the refereed proceedings of the 5th International Symposium on Static Analysis, SAS'98, held in Pisa, Italy, in September 1998. The 20 revised full papers presented were reviewed and selected from a total of 48 submissions. Also included is an invited tutorial. The papers are organized into topical sections on data flow analysis, logic programming, concurrency, abstract domains, partial evaluation, type inference and optimization. The invited tutorial by David Schmidt and Bernhard Steffen is entitled Data-flow analysis as model checking of abstract interpretations.

Spis treści

Data-Flow Analysis.- Bidirectional Data Flow Analysis in Code Motion: Myth and Reality.- On a New Method for Dataflow Analysis of Java Virtual Machine Subroutines.- Enabling Sparse Constant Propagation of Array Elements via Array SSA Form.- Assessing the Effects of Flow-Sensitivity on Pointer Alias Analyses.- Logic Programming.- Analysis of Normal Logic Programs.- The Correctness of Set-Sharing.- Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing.- Concurrency.- A Symbolic Semantics for Abstract Model Checking.- Automatic Determination of Communication Topologies in Mobile Systems.- Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation.- Abstract Domains.- A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs.- Refining Static Analyses by Trace-Based Partitioning Using Control Flow.- Building Complete Abstract Interpretations in a Linear Logic-Based Setting.- Partial Evaluation.- On the Power of Homeomorphic Embedding for Online Termination.- Analysis of Imperative Programs through Analysis of Constraint Logic Programs.- Improving Control in Functional Logic Program Specialization.- Type Inference.- Directional Type Inference for Logic Programs.- Finite Subtype Inference with Explicit Polymorphism.- Optimization.- Sparse Jacobian Computation in Automatic Differentiation by Static Program Analysis.- A New Solution to the Hidden Copy Problem.- Tutorials.- A Tutorial on Domain Theory in Abstract Interpretation.- Program Analysis as Model Checking of Abstract Interpretations.- Invited Talks.- Certifying, Optimizing Compilation.