Static Analysis

20th International Symposium, SAS 2013, Seattle, WA, USA, June 20-22, 2013. Proceedings

Editors:

ISBN: 978-3-642-38855-2 (Print) 978-3-642-38856-9 (Online)

Table of contents (25 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-3

    Static Analysis by Abstract Interpretation of Numerical Programs and Systems, and FLUCTUAT

  3. No Access

    Book Chapter

    Pages 4-5

    Static Analysis in the Continuously Changing World

  4. No Access

    Book Chapter

    Pages 6-24

    Abstract Interpretation over Non-lattice Abstract Domains

  5. No Access

    Book Chapter

    Pages 25-42

    Localizing Widening and Narrowing

  6. No Access

    Book Chapter

    Pages 43-62

    The Abstract Domain of Segmented Ranking Functions

  7. No Access

    Book Chapter

    Pages 63-83

    Symbolic Automata for Static Specification Mining

  8. No Access

    Book Chapter

    Pages 84-104

    Predicate Abstraction for Relaxed Memory Models

  9. No Access

    Book Chapter

    Pages 105-125

    On Solving Universally Quantified Horn Clauses

  10. No Access

    Book Chapter

    Pages 126-149

    From Concrete Examples to Heap Manipulating Programs

  11. No Access

    Book Chapter

    Pages 150-171

    Local Shape Analysis for Overlaid Data Structures

  12. No Access

    Book Chapter

    Pages 172-193

    Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists

  13. No Access

    Book Chapter

    Pages 194-214

    Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing

  14. No Access

    Book Chapter

    Pages 215-237

    Byte-Precise Verification of Low-Level List Manipulation

  15. No Access

    Book Chapter

    Pages 238-258

    Abstract Semantic Differencing for Numerical Programs

  16. No Access

    Book Chapter

    Pages 259-282

    Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation

  17. No Access

    Book Chapter

    Pages 283-303

    Automatic Synthesis of Deterministic Concurrency

  18. No Access

    Book Chapter

    Pages 304-323

    Witnessing Program Transformations

  19. No Access

    Book Chapter

    Pages 324-344

    Formal Verification of a C Value Analysis Based on Abstract Interpretation

  20. No Access

    Book Chapter

    Pages 345-365

    Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

  21. No Access

    Book Chapter

    Pages 366-387

    Static Provenance Verification for Message Passing Programs

previous Page of 2