Static Analysis: 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, ProceedingsRoberto Giacobazzi 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). |
Contents
Invited Talks | 1 |
Program Generators and the Tools to Make Them | 19 |
Completeness Refinement in Abstract Symbolic Trajectory Evaluation | 38 |
ConstraintBased LinearRelations Analysis | 53 |
Spatial Analysis of BioAmbients | 69 |
Security and Safety | 84 |
Information Flow Analysis in Logical Form | 100 |
Type Inference Against Races | 116 |
A PolynomialTime Algorithm for Global Value Numbering | 212 |
Shape Analysis | 228 |
A Relational Approach to Interprocedural Shape Analysis | 246 |
Partially Disjunctive Heap Abstraction | 265 |
Abstract Domain and Data Structures | 280 |
Approximating the Algebraic Relational Semantics | 296 |
The Octahedron Abstract Domain | 312 |
PathSensitive Analysis for Linear Arithmetic | 328 |
Pointer Analysis | 129 |
A Scalable Nonuniform Pointer Analysis for Embedded Programs | 149 |
BottomUp and TopDown ContextSensitive | 165 |
Abstract Interpretation and Algorithms | 181 |
Static Analysis of Gated Data Dependence Graphs | 197 |
Shape Analysis and Logic | 344 |
Generalized Records and Spatial Conjunction in Role Logic | 361 |
Termination Analysis | 377 |
| 393 | |
Other editions - View all
Static Analysis: 11th International Symposium, SAS 2004, Verona, Italy ... Roberto Giacobazzi No preview available - 2004 |
Common terms and phrases
3-valued structures abstract domain abstract interpretation algorithm approximation assertion assignment binary boolean complete complete lattice Computer Science concrete constraints Cousot data structures decision diagrams defined Definition denote destructive updates equivalences example expressions Farkas Lemma FCED Figure finite fixed point formula function Galois connection Giacobazzi graph Gröbner basis heap abstraction imperative programs implementation inequalities input integer interprocedural invariants iteration lattice Lemma linear LNCS lock loop loop invariants malloc method model checking node octahedra octahedron parameters pointer analysis points-to polynomial postcondition powerset precise predicates Principles of Programming procedure program point program variables Programming Languages properties pseudo ideals query reachable recursive relation represent representation result role logic rule satisfies Section security type semantics shape analysis spatial conjunction specification Springer-Verlag static analysis Theorem tion transition transition relation type inference verification μα