Book Volume 6806 2011

Computer Aided Verification

23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings

Editors:

ISBN: 978-3-642-22109-5 (Print) 978-3-642-22110-1 (Online)

Table of contents (60 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. No Access

    Chapter

    Pages 1-19

    HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection

  3. No Access

    Chapter

    Pages 20-20

    Using Types for Software Verification

  4. No Access

    Chapter

    Pages 21-27

    SMT-Based Modular Analysis of Sequential Systems Code

  5. No Access

    Chapter

    Pages 28-43

    Logic and Compositional Verification of Hybrid Systems

  6. No Access

    Chapter

    Pages 44-49

    Using Coverage to Deploy Formal Verification in a Simulation World

  7. No Access

    Chapter

    Pages 50-66

    Stability in Weak Memory Models

  8. No Access

    Chapter

    Pages 67-82

    Verification of Certifying Computations

  9. No Access

    Chapter

    Pages 83-98

    Parameter Identification for Markov Models of Biochemical Reactions

  10. No Access

    Chapter

    Pages 99-115

    Getting Rid of Store-Buffers in TSO Analysis

  11. No Access

    Chapter

    Pages 116-131

    Malware Analysis with Tree Automata Inference

  12. No Access

    Chapter

    Pages 132-148

    State/Event-Based LTL Model Checking under Parametric Generalized Fairness

  13. No Access

    Chapter

    Pages 149-164

    Resolution Proofs and Skolem Functions in QBF Evaluation and Applications

  14. No Access

    Chapter

    Pages 165-170

    The BINCOA Framework for Binary Code Analysis

  15. No Access

    Chapter

    Pages 171-177

    CVC4

  16. No Access

    Chapter

    Pages 178-183

    SLAyer: Memory Safety for Systems-Level Code

  17. No Access

    Chapter

    Pages 184-190

    CPAchecker: A Tool for Configurable Software Verification

  18. No Access

    Chapter

    Pages 191-207

    Existential Quantification as Incremental SAT

  19. No Access

    Chapter

    Pages 208-224

    Efficient Analysis of Probabilistic Programs with an Unbounded Counter

  20. No Access

    Chapter

    Pages 225-242

    Model Checking Algorithms for CTMDPs

  21. No Access

    Chapter

    Pages 243-259

    Quantitative Synthesis for Concurrent Programs

previous Page of 3