Static Analysis: 18th International Symposium, SAS 2011. Venice, Italy, September 14-16, 2011. Proceedings

Front Cover
Eran Yahav
Springer Science & Business Media, Sep 6, 2011 - Computers - 387 pages

This book constitutes the refereed proceedings of the 18th International Symposium on Static Analysis, SAS 2011, held in Venice, Italy, in September 2011.

The 22 revised full papers were selected from 67 submissions. Also included in this volume are the abstracts of the invited talks that were given at the symposium by renowned experts in the field. The papers address all aspects of static analysis, including abstract domains, abstract interpretation, abstract testing, data flow analysis, bug detection, program transformation, program verification, security analysis and type checking.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Widening and Interpolation
1
A WinWin Deal
2
Program Analysis for Web Security
4
Design and Experience
5
Formal Model Reduction
6
An Abstract Interpretation Formulation
7
The Complexity of Abduction for Separated Heap Abstractions
25
Efficient Decision Procedures for Heaps Using STRAND
43
A Family of Abstract Interpretations for Static Analysis of Concurrent HigherOrder Programs
180
Abstract Domains of Affine Relations
198
Transitive Closures of AĆne Integer Tuple Relations and Their Overapproximations
216
LogicoNumerical Abstract Acceleration and Application to the Verification of DataFlow Programs
233
Invisible Invariants and Abstract Interpretation
249
An AbstractionRefinement Framework for Trigger Querying
263
Bound Analysis of Imperative Programs with the SizeChange Abstraction
280
Satisfiability Modulo Recursive Programs
298

The FlowInsensitive Precision of Andersens Analysis in Practice
60
SideEffect Analysis of Assembly Code
77
Directed Symbolic Execution
95
Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation
112
On Sequentializing Concurrent Programs
129
Verifying Fence Elimination Optimisations
146
An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs
163
Probabilistically Accurate Program Transformations
316
Probabilistic Abstractions with Arbitrary Domains
334
Software Verification Using kInduction
351
Using Bounded Model Checking to Focus Fixpoint Iterations
369
Author Index
386
Copyright

Other editions - View all

Common terms and phrases