Static Analysis -

. .

Résumé :
Static analysis allows us to determine aspects of the dynamic behavior of p- grams and systems without actually executing them. Traditionally used in - timizing compilers, static analysis is now also used extensively in veri?cation, software certi?cation and semantics-based manipulation. The research com- nity in static analysis covers a broad spectrum from foundational issues ? new semantic models of programming languages and systems ? through to practical tools.TheseriesofStatic AnalysisSymposia hasservedasthe primaryvenue for presentation and discussion of theoretical, practical and application advances in the area. This volume contains the papers accepted for presentation at the 12th Int- national Static Analysis Symposium (SAS 2005) which was held 7?9 September 2005 at Imperial College London. A total of 66 papers were submitted; the Program Committee held an online discussion which led to the selection of 22 papers for presentation. The selection was based on scienti?c quality, originality and relevance to the scope of SAS. Every paper was reviewed by at least 3 PC members or external referees. This volume also includes abstracts of talks given by the two invited speakers: Samson Abramsky FRS (University of Oxford) and Andrew Gordon (Microsoft Research, Cambridge). OnbehalfoftheProgramCommittee,theProgramChairwouldliketothank all of the authors who submitted papers and all of the external referees for their careful work in the reviewing process. The Program Chair would also parti- larly like to thank Igor Siveroni who provided local support for the conference management system and who helped in organizing the structure of this volume.

Sommaire:
Invited Talks.- Algorithmic Game Semantics and Static Analysis.- From Typed Process Calculi to Source-Based Security.- Contributed Papers.- Widening Operators for Weakly-Relational Numeric Abstractions.- Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra.- Inference of Well-Typings for Logic Programs with Application to Termination Analysis.- Memory Space Conscious Loop Iteration Duplication for Reliable Execution.- Memory Usage Verification for OO Programs.- Abstraction Refinement for Termination.- Data-Abstraction Refinement: A Game Semantic Approach.- Locality-Based Abstractions.- Type-Safe Optimisation of Plugin Architectures.- Using Dependent Types to Certify the Safety of Assembly Code.- The PER Model of Abstract Non-interference.- A Relational Abstraction for Functions.- Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis.- Banshee: A Scalable Constraint-Based Analysis Toolkit.- A Generic Framework for Interprocedural Analysis of Numerical Properties.- Finding Basic Block and Variable Correspondence.- Boolean Heaps.- Interprocedural?Shape?Analysis for?Cutpoint-Free?Programs.- Understanding the Origin of Alarms in Astr?e.- Pair-Sharing Analysis of Object-Oriented Programs.- Exploiting Sparsity in Polyhedral Analysis.- Secure Information Flow as a Safety Problem....