Static Analysis: 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 12th International Symposium on Static Analysis, SAS 2005, held in London, UK in August 2005, co-located with the International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2005).

The 22 revised full papers presented together with the abstracts of 2 invited talks were carefully reviewed and selected from 66 submissions. The papers address all aspects of static analysis including program and systems verification, shape analysis and logic, termination analysis, security and safety, abstract interpretation and algorithms, abstract domain and data structures, pointer analysis, shape analysis, and data flow analysis.

Author(s): Samson Abramsky (auth.), Chris Hankin, Igor Siveroni (eds.)
Series: Lecture Notes in Computer Science 3672 : Programming and Software Engineering
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Pages: 374
Tags: Programming Languages, Compilers, Interpreters; Programming Techniques; Software Engineering; Logics and Meanings of Programs; Mathematical Logic and Formal Languages

Front Matter....Pages -
Algorithmic Game Semantics and Static Analysis....Pages 1-1
From Typed Process Calculi to Source-Based Security....Pages 2-2
Widening Operators for Weakly-Relational Numeric Abstractions....Pages 3-18
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra....Pages 19-34
Inference of Well-Typings for Logic Programs with Application to Termination Analysis....Pages 35-51
Memory Space Conscious Loop Iteration Duplication for Reliable Execution....Pages 52-69
Memory Usage Verification for OO Programs....Pages 70-86
Abstraction Refinement for Termination....Pages 87-101
Data-Abstraction Refinement: A Game Semantic Approach....Pages 102-117
Locality-Based Abstractions....Pages 118-134
Type-Safe Optimisation of Plugin Architectures....Pages 135-154
Using Dependent Types to Certify the Safety of Assembly Code....Pages 155-170
The PER Model of Abstract Non-interference....Pages 171-185
A Relational Abstraction for Functions....Pages 186-202
Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis....Pages 203-217
Banshee: A Scalable Constraint-Based Analysis Toolkit....Pages 218-234
A Generic Framework for Interprocedural Analysis of Numerical Properties....Pages 235-250
Finding Basic Block and Variable Correspondence....Pages 251-267
Boolean Heaps....Pages 268-283
Interprocedural Shape Analysis for Cutpoint-Free Programs....Pages 284-302
Understanding the Origin of Alarms in Astrée ....Pages 303-319
Pair-Sharing Analysis of Object-Oriented Programs....Pages 320-335
Exploiting Sparsity in Polyhedral Analysis....Pages 336-351
Secure Information Flow as a Safety Problem....Pages 352-367
Back Matter....Pages -