Static Analysis: 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings (Lecture Notes in Computer Science, 3148)

Static analysis is a research area aimed at developing principles and tools for veri?cation, certi?cation, semantics-based manipulation, and high-performance implementation of programming languages and systems. The series of Static Analysis symposia has served as the primary venue for presentation and disc- sion of theoretical, practical, and application advances in the area. This volume contains the papers accepted for presentation at the 11th Int- nationalStaticAnalysisSymposium(SAS2004), whichwasheldAugust26-28in Verona, Italy.Inresponse to the callfor papers,63contributions weresubmitted from 20 di?erent countries. Following on-line discussions, the ProgramComm- tee met in Verona on May 06, and selected 23 papers, basing this choice on their scienti?c quality, originality, and relevance to the symposium. Each paper was reviewed by at least 3 PC members or external referees. In addition to the contributed papers, this volume includes contributions by outstanding invited speakers: a full invited paper by Thomas Henzinger (University of Califorina at Berkeley), and abstracts of the talks given by the other invited speakers, Sheila McIlraith (University of Toronto), Ehud Shapiro (Weizmann Institute) and Yannis Smaragdakis (Georgia Institute of Technology). Frontmatter Invited Talks Injecting Life with Computers The {\sc Blast} Query Language for Software Verification Program Generators and the Tools to Make Them Towards Declarative Programming for Web Services Program and System Verification Closed and Logical Relations for Over- and Under-Approximation of Powersets Completeness Refinement in Abstract Symbolic Trajectory Evaluation Constraint-Based Linear-Relations Analysis Spatial Analysis of BioAmbients Security and Safety Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language Information Flow Analysis in Logical Form Type Inference Against Races Pointer Analysis Pointer-Range Analysis A Scalable Nonuniform Pointer Analysis for Embedded Programs Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer Analysis Abstract Interpretation and Algorithms Abstract Interpretation of Combinational Asynchronous Circuits Static Analysis of Gated Data Dependence Graphs A Polynomial-Time Algorithm for Global Value Numbering Shape Analysis Quantitative Shape Analysis A Relational Approach to Interprocedural Shape Analysis Partially Disjunctive Heap Abstraction Abstract Domain and Data Structures An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants Approximating the Algebraic Relational Semantics of Imperative Programs The Octahedron Abstract Domain Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions Shape Analysis and Logic On Logics of Aliasing Generalized Records and Spatial Conjunction in Role Logic Termination Analysis Non-termination Inference for Constraint Logic Programs Backmatter

This book constitutes the refereed proceedings of the 11th International Symposium on Static Analysis, SAS 2004, held in Verona, Italy in August 2004.

The 23 revised full papers presented with an invited paper and abstracts of 3 invited talks were carefully reviewed and selected from 63 submissions. The papers are organized in topical sections on program and systems verification, security and safety, pointer analysis, abstract interpretation and algorithms, shape analysis, abstract domain and data structures, shape analysis and logic, and termination analysis.

This book constitutes the refereed proceedings of the 11th International Symposium on Static Analysis, SAS 2004, held in Verone, Italy in August 2004. The 23 revised full papers presented with an invited paper and abstracts of 3 invited talks were carefully reviewed and selected from 63 submissions. The papers are organized in topical sections on program and systems verification, security and sefety, pointer alaysis, abstract interpretation and algorithms, shape analysis, abstract domain and data structures, shape analysis and logic, and termination alanysis