Static Analysis

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

Editors:

ISBN: 978-3-642-23701-0 (Print) 978-3-642-23702-7 (Online)

Table of contents (27 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-1

    Widening and Interpolation

  3. No Access

    Book Chapter

    Pages 2-3

    Program Analysis and Machine Learning: A Win-Win Deal

  4. No Access

    Book Chapter

    Pages 4-4

    Program Analysis for Web Security

  5. No Access

    Book Chapter

    Pages 5-5

    Astrée: Design and Experience

  6. No Access

    Book Chapter

    Pages 6-6

    Formal Model Reduction

  7. No Access

    Book Chapter

    Pages 7-24

    Purity Analysis: An Abstract Interpretation Formulation

  8. No Access

    Book Chapter

    Pages 25-42

    The Complexity of Abduction for Separated Heap Abstractions

  9. No Access

    Book Chapter

    Pages 43-59

    Efficient Decision Procedures for Heaps Using STRAND

  10. No Access

    Book Chapter

    Pages 60-76

    The Flow-Insensitive Precision of Andersen’s Analysis in Practice

  11. No Access

    Book Chapter

    Pages 77-94

    Side-Effect Analysis of Assembly Code

  12. No Access

    Book Chapter

    Pages 95-111

    Directed Symbolic Execution

  13. No Access

    Book Chapter

    Pages 112-128

    Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation

  14. No Access

    Book Chapter

    Pages 129-145

    On Sequentializing Concurrent Programs

  15. No Access

    Book Chapter

    Pages 146-162

    Verifying Fence Elimination Optimisations

  16. No Access

    Book Chapter

    Pages 163-179

    An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs

  17. No Access

    Book Chapter

    Pages 180-197

    A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs

  18. No Access

    Book Chapter

    Pages 198-215

    Abstract Domains of Affine Relations

  19. No Access

    Book Chapter

    Pages 216-232

    Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations

  20. No Access

    Book Chapter

    Pages 233-248

    Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs

  21. No Access

    Book Chapter

    Pages 249-262

    Invisible Invariants and Abstract Interpretation

previous Page of 2