Book Volume 9779 2016

Computer Aided Verification

28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I

Editors:

ISBN: 978-3-319-41527-7 (Print) 978-3-319-41528-4 (Online)

Table of contents (29 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XVII

  2. Probabilistic Systems

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-22

      Termination Analysis of Probabilistic Programs Through Positivstellensatz’s

    3. No Access

      Chapter

      Pages 23-42

      Markov Chains and Unambiguous Büchi Automata

    4. No Access

      Chapter

      Pages 43-61

      Synthesizing Probabilistic Invariants via Doob’s Decomposition

    5. No Access

      Chapter

      Pages 62-83

      PSI: Exact Symbolic Inference for Probabilistic Programs

    6. No Access

      Chapter

      Pages 84-91

      PSCV: A Runtime Verification Tool for Probabilistic SystemC Models

  3. Synthesis I

    1. Front Matter

      Pages 93-93

    2. No Access

      Chapter

      Pages 95-117

      Structural Synthesis for GXW Specifications

    3. No Access

      Chapter

      Pages 118-135

      Bounded Cycle Synthesis

    4. No Access

      Chapter

      Pages 136-156

      Fast, Flexible, and Minimal CTL Synthesis via SMT

    5. No Access

      Chapter

      Pages 157-176

      Synthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems

  4. Constraint Solving I

    1. Front Matter

      Pages 177-177

    2. No Access

      Chapter

      Pages 179-198

      A Decision Procedure for Sets, Binary Relations and Partial Functions

    3. No Access

      Chapter

      Pages 199-217

      Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories

    4. No Access

      Chapter

      Pages 218-240

      Progressive Reasoning over Recursively-Defined Strings

    5. No Access

      Chapter

      Pages 241-260

      String Analysis via Automata Manipulation with Logic Circuit Representation

    6. No Access

      Chapter

      Pages 261-268

      Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata

  5. Model Checking I

    1. Front Matter

      Pages 269-269

    2. No Access

      Chapter

      Pages 271-291

      Infinite-State Liveness-to-Safety via Implicit Abstraction and Well-Founded Relations

    3. No Access

      Chapter

      Pages 292-309

      Proving Parameterized Systems Safe by Generalizing Clausal Proofs of Small Instances

    4. No Access

      Chapter

      Pages 310-328

      Learning-Based Assume-Guarantee Regression Verification

    5. No Access

      Chapter

      Pages 329-351

      Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement

    6. No Access

      Chapter

      Pages 352-358

      JayHorn: A Framework for Verifying Java programs

  6. Program Analysis

    1. Front Matter

      Pages 359-359

    2. No Access

      Chapter

      Pages 361-381

      Trigger Selection Strategies to Stabilize Program Verifiers

previous Page of 2