Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Computer Aided Verification - 19th International Conference, CAV 2007, Berlin, Germany, July 3-7,

Computer Aided Verification

19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings

Damm, Werner, Hermanns, Holger (Eds.)

2007, XV, 562 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$109.00

(net) price for USA

ISBN 978-3-540-73368-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$139.00

(net) price for USA

ISBN 978-3-540-73367-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Addresses all the current issues in computer aided verification and model checking
  • Features contributions from leading innovators in the field, presenting the state of the technology
  • Explores topics ranging from foundational and methodological issues to the evaluation of major tools and systems

This book constitutes the refereed proceedings of the 19th International Conference on Computer Aided Verification held in Berlin, Germany in July 2007. The conference was run in conjunction with the 14th Workshop on Model Checking Software

Thirty-three full papers are presented, together with fourteen tool papers, three invited papers, and four invited tutorials. These papers were contributed by leading innovators in computer aided verification. Collectively, they represent the state of the technology. All the current issues in computer aided verification and model checking—from foundational and methodological issues to the evaluation of major tools and systems—are addressed.

The papers are organized into topical sections on compositionality, verification process, timed synthesis and games, infinite state verification, tool environments, shapes, concurrent program verification, reactive designs, parallelization, constraints and decisions, probabilistic verification, abstraction, assume-guarantee reasoning, hybrid systems, program analysis, SAT, and decision procedures.

Content Level » Research

Keywords » Erfüllbarkeitsproblem der Aussagenlogik - Java - algorithms - automata - automated deduction - computational logic - computer aided verification - formal method - formal methods - formal program analysis - formal verification - model checking - probabilistic verification - reactive desi - verification

Related subjects » Artificial Intelligence - Hardware - Software Engineering - Theoretical Computer Science

Table of contents 

Invited Talks.- Automatically Proving Program Termination.- A Mathematical Approach to RTL Verification.- Software Bugs Seen from an Industrial Perspective or Can Formal Methods Help on Automotive Software Development?.- Invited Tutorials.- Algorithms for Interface Synthesis.- A Tutorial on Satisfiability Modulo Theories.- A JML Tutorial: Modular Specification and Verification of Functional Behavior for Java.- Verification of Hybrid Systems.- Session I: Compositionality.- SAT-Based Compositional Verification Using Lazy Learning.- Local Proofs for Global Safety Properties.- Session II: Verification Process.- Low-Level Library Analysis and Summarization.- Verification Across Intellectual Property Boundaries.- Session III: Timed Synthesis and Games.- On Synthesizing Controllers from Bounded-Response Properties.- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games.- UPPAAL-Tiga: Time for Playing Games!.- The TASM Toolset: Specification, Simulation, and Formal Verification of Real-Time Systems.- Session IV: Infinitive State Verification.- Systematic Acceleration in Regular Model Checking.- Parameterized Verification of Infinite-State Processes with Global Conditions.- Session V: Tool Environment.- CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes.- jMoped: A Test Environment for Java Programs.- Hector: Software Model Checking with Cooperating Analysis Plugins.- The Why/Krakatoa/Caduceus Platform for Deductive Program Verification.- Session VI: Shapes.- Shape Analysis for Composite Data Structures.- Array Abstractions from Proofs.- Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures.- Revamping TVLA: Making Parametric Shape Analysis Competitive.- Session VII: Concurrent Program Verification.- Fast and Accurate Static Data-Race Detection for Concurrent Programs.- Parametric and Sliced Causality.- Spade: Verification of Multithreaded Dynamic and Recursive Programs.- Session VIII: Reactive Designs.- Anzu: A Tool for Property Synthesis.- RAT: A Tool for the Formal Analysis of Requirements.- Session IX: Parallelisation.- Parallelising Symbolic State-Space Generators.- I/O Efficient Accepting Cycle Detection.- Session X: Constraints and Decisions.- C32SAT: Checking C Expressions.- CVC3.- BAT: The Bit-Level Analysis Tool.- LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals.- Session XI: Probabilistic Verification.- Three-Valued Abstraction for Continuous-Time Markov Chains.- Magnifying-Lens Abstraction for Markov Decision Processes.- Underapproximation for Model-Checking Based on Random Cryptographic Constructions.- Session XII: Abstraction.- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra.- Structural Abstraction of Software Verification Conditions.- An Abstract Domain for Analyzing Heap-Manipulating Low-Level Software.- Adaptive Symmetry Reduction.- Session XIII: Assume-Guarantee Reasoning.- From Liveness to Promptness.- Automated Assumption Generation for Compositional Verification.- Session XIV: Hybrid Systems.- Abstraction and Counterexample-Guided Construction of ?-Automata for Model Checking of Step-Discrete Linear Hybrid Models.- Test Coverage for Continuous and Hybrid Systems.- Hybrid Systems: From Verification to Falsification.- Session XV: Program Analysis.- Comparison Under Abstraction for Verifying Linearizability.- Leaping Loops in the Presence of Abstraction.- Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis.- Session XVI: SAT and Decision Procedures.- A Decision Procedure for Bit-Vectors and Arrays.- Boolean Abstraction for Temporal Logic Satisfiability.- A Lazy and Layered SMT( ) Solver for Hard Industrial Verification Problems.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.