Static Analysis: 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings: Lecture Notes in Computer Science, cartea 3672

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.