Static Analysis

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

  • Eran Yahav
Conference proceedings SAS 2011

DOI: 10.1007/978-3-642-23702-7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6887)

Table of contents (27 papers)

  1. Front Matter
  2. Widening and Interpolation
    Kenneth L. McMillan
    Pages 1-1
  3. Program Analysis and Machine Learning: A Win-Win Deal
    Aditya V. Nori, Sriram K. Rajamani
    Pages 2-3
  4. Program Analysis for Web Security
    John C. Mitchell
    Pages 4-4
  5. Astrée: Design and Experience
    Daniel Kästner
    Pages 5-5
  6. Formal Model Reduction
    Jérôme Feret
    Pages 6-6
  7. Purity Analysis: An Abstract Interpretation Formulation
    Ravichandhran Madhavan, Ganesan Ramalingam, Kapil Vaswani
    Pages 7-24
  8. The Complexity of Abduction for Separated Heap Abstractions
    Nikos Gorogiannis, Max Kanovich, Peter W. O’Hearn
    Pages 25-42
  9. Efficient Decision Procedures for Heaps Using STRAND
    P. Madhusudan, Xiaokang Qiu
    Pages 43-59
  10. The Flow-Insensitive Precision of Andersen’s Analysis in Practice
    Sam Blackshear, Bor-Yuh Evan Chang, Sriram Sankaranarayanan, Manu Sridharan
    Pages 60-76
  11. Side-Effect Analysis of Assembly Code
    Andrea Flexeder, Michael Petter, Helmut Seidl
    Pages 77-94
  12. Directed Symbolic Execution
    Kin-Keung Ma, Khoo Yit Phang, Jeffrey S. Foster, Michael Hicks
    Pages 95-111
  13. Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation
    Patrice Godefroid, Shuvendu K. Lahiri, Cindy Rubio-González
    Pages 112-128
  14. On Sequentializing Concurrent Programs
    Ahmed Bouajjani, Michael Emmi, Gennaro Parlato
    Pages 129-145
  15. Verifying Fence Elimination Optimisations
    Viktor Vafeiadis, Francesco Zappa Nardelli
    Pages 146-162
  16. Abstract Domains of Affine Relations
    Matt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas Reps
    Pages 198-215
  17. Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations
    Sven Verdoolaege, Albert Cohen, Anna Beletska
    Pages 216-232

About these proceedings

Introduction

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.

Keywords

Concurrency logic programming model checking program verification software maintenance

Editors and affiliations

  • Eran Yahav
    • 1
  1. 1.Computer Science DeptartementTechnionTechnion CityIsrael

Bibliographic information

  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-23701-0
  • Online ISBN 978-3-642-23702-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349