Automated Technology for Verification and Analysis

11th International Symposium, ATVA 2013, Hanoi, Vietnam, October 15-18, 2013. Proceedings

Editors:

ISBN: 978-3-319-02443-1 (Print) 978-3-319-02444-8 (Online)

Table of contents (45 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Papers

    1. No Access

      Book Chapter

      Pages 1-4

      Acceleration for Petri Nets

    2. No Access

      Book Chapter

      Pages 5-22

      Automated Verification and Strategy Synthesis for Probabilistic Systems

    3. No Access

      Book Chapter

      Pages 23-23

      SMT-Based Software Model Checking

  3. Regular Papers

    1. No Access

      Book Chapter

      Pages 24-39

      Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment

    2. No Access

      Book Chapter

      Pages 40-54

      Improved Upper and Lower Bounds for Büchi Disambiguation

    3. No Access

      Book Chapter

      Pages 55-70

      Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points

    4. No Access

      Book Chapter

      Pages 71-86

      An Automatic Technique for Checking the Simulation of Timed Systems

    5. No Access

      Book Chapter

      Pages 87-101

      Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games

    6. No Access

      Book Chapter

      Pages 102-117

      Kleene Algebras and Semimodules for Energy Problems

    7. No Access

      Book Chapter

      Pages 118-132

      Looking at Mean-Payoff and Total-Payoff through Windows

    8. No Access

      Book Chapter

      Pages 133-147

      Weighted Safety

    9. No Access

      Book Chapter

      Pages 148-162

      A Framework for Ranking Vacuity Results

    10. No Access

      Book Chapter

      Pages 163-177

      Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications

    11. No Access

      Book Chapter

      Pages 178-192

      Verification of a Dynamic Management Protocol for Cloud Applications

    12. No Access

      Book Chapter

      Pages 193-207

      Compact Symbolic Execution

    13. No Access

      Book Chapter

      Pages 208-223

      Multi-threaded Explicit State Space Exploration with State Reconstruction

    14. No Access

      Book Chapter

      Pages 224-239

      Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata

    15. No Access

      Book Chapter

      Pages 240-254

      Integrating Policy Iterations in Abstract Interpreters

    16. No Access

      Book Chapter

      Pages 255-271

      Interpolation Properties and SAT-Based Model Checking

    17. No Access

      Book Chapter

      Pages 272-286

      Analysis of Message Passing Programs Using SMT-Solvers

previous Page of 3