Static Analysis

Static analysis is increasingly recognized as a fundamental reasearch area aimed at studying and developing tools for high performance implementations and v- i cation systems for all programming language paradigms. The last two decades have witnessed substantial developments in this eld, ranging from theoretical frameworks to design, implementation, and application of analyzers in optim- ing compilers. Since 1994, SAS has been the annual conference and forum for researchers in all aspects of static analysis. This volume contains the proceedings of the 6th International Symposium on Static Analysis (SAS'99) which was held in Venice, Italy, on 22{24 September 1999. The previous SAS conferences were held in Namur (Belgium), Glasgow (UK), Aachen (Germany), Paris (France), and Pisa (Italy). The program committee selected 18 papers out of 42 submissions on the basis of at least three reviews. The resulting volume o ers to the reader a complete landscape of the research in this area. The papers contribute to the following topics: foundations of static analysis, abstract domain design, and applications of static analysis to di erent programming paradigms (concurrent, synchronous, imperative, object oriented, logical, and functional). In particular, several papers use static analysis for obtaining state space reduction in concurrent systems. New application elds are also addressed, such as the problems of security and secrecy.

Includes supplementary material: sn.pub/extras

Inhalt
Synchronization in JAVA Programs.- A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives.- Static Analyses for Eliminating Unnecessary Synchronization from Java Programs.- Synchronous Languages.- Dynamic Partitioning in Analyses of Numerical Properties.- Polyhedral Analysis for Synchronous Languages.- Abstract Domains.- Decomposing Non-redundant Sharing by Complementation.- Freeness Analysis Through Linear Refinement.- Binary Decision Graphs.- Binding-Time Analysis for Both Static and Dynamic Expressions.- Concurrency.- Abstract Interpretation of Mobile Ambients.- Abstracting Cryptographic Protocols with Tree Automata.- State Space Reduction Based on Live Variables Analysis.- Static Single Assignment.- Partial Dead Code Elimination Using Extended Value Graph.- Translating Out of Static Single Assignment Form.- Optimizations.- Eliminating Dead Code on Recursive Data.- Detecting Equalities of Variables: Combining Efficiency with Precision.- Foundations.- A New Class of Functions for Abstract Interpretation.- Equational Semantics.- Abstract Animator for Temporal Specifications: Application to TLA.- Invited Talks and Tutorials.- Static Analysis of Mega-Programs.- Safety versus Secrecy.- On the Complexity Analysis of Static Analyses.- Model-Checking.- Tutorial: Techniques to Improve the Scalability and Precision of Data Flow Analysis.