06184nam 22007455 450 99646560250331620230406051307.03-540-37411-610.1007/11817963(CKB)1000000000233072(SSID)ssj0000316851(PQKBManifestationID)11246854(PQKBTitleCode)TC0000316851(PQKBWorkID)10276292(PQKB)10292723(DE-He213)978-3-540-37411-4(MiAaPQ)EBC3068225(PPN)123137381(EXLCZ)99100000000023307220101221d2006 u| 0engurnn#008mamaatxtccrComputer Aided Verification[electronic resource] 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings /edited by Thomas Ball, Robert B. Jones1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XV, 564 p.)Theoretical Computer Science and General Issues,2512-2029 ;4144Bibliographic Level Mode of Issuance: Monograph3-540-37406-X Includes bibliographical references and index.Invited Talks -- Formal Specifications on Industrial-Strength Code—From Myth to Reality -- I Think I Voted: E-Voting vs. Democracy -- Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs -- The Ideal of Verified Software -- Session 1. Automata -- Antichains: A New Algorithm for Checking Universality of Finite Automata -- Safraless Compositional Synthesis -- Minimizing Generalized Büchi Automata -- Session 2. Tools Papers -- Ticc: A Tool for Interface Compatibility and Composition -- FAST Extended Release -- Session 3. Arithmetic -- Don’t Care Words with an Application to the Automata-Based Approach for Real Addition -- A Fast Linear-Arithmetic Solver for DPLL(T) -- Session 4. SAT and Bounded Model Checking -- Bounded Model Checking for Weak Alternating Büchi Automata -- Deriving Small Unsatisfiable Cores with Dominators -- Session 5. Abstraction/Refinement -- Lazy Abstraction with Interpolants -- Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop -- Counterexamples with Loops for Predicate Abstraction -- Session 6. Tools Papers -- cascade: C Assertion Checker and Deductive Engine -- Yasm: A Software Model-Checker for Verification and Refutation -- Session 7. Symbolic Trajectory Evaluation -- SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation -- Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation -- Session 8. Property Specification and Verification -- Some Complexity Results for SystemVerilog Assertions -- Check It Out: On the Efficient Formal Verification of Live Sequence Charts -- Session 9. Time -- Symmetry Reduction for Probabilistic Model Checking -- Communicating Timed Automata: The More Synchronous, the More Difficult to Verify -- Allen Linear (Interval) Temporal Logic – Translation to LTL and Monitor Synthesis -- Session 10. Tools Papers -- DiVinE – A Tool for Distributed Verification -- EverLost: A Flexible Platform for Industrial-Strength Abstraction-Guided Simulation -- Session 11. Concurrency -- Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions -- Model Checking Multithreaded Programs with Asynchronous Atomic Methods -- Causal Atomicity -- Session 12. Trees, Pushdown Systems and Boolean Programs -- Languages of Nested Trees -- Improving Pushdown System Model Checking -- Repair of Boolean Programs with an Application to C -- Session 13. Termination -- Termination of Integer Linear Programs -- Automatic Termination Proofs for Programs with Shape-Shifting Heaps -- Termination Analysis with Calling Context Graphs -- Session 14. Tools Papers -- Terminator: Beyond Safety -- CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools -- Session 15. Abstract Interpretation -- SMT Techniques for Fast Predicate Abstraction -- The Power of Hybrid Acceleration -- Lookahead Widening -- Session 16. Tools Papers -- The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover -- LEVER: A Tool for Learning Based Verification -- Session 17. Memory Consistency -- Formal Verification of a Lazy Concurrent List-Based Set Algorithm -- Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study -- Fast and Generalized Polynomial Time Memory Consistency Verification -- Session 18. Shape Analysis -- Programs with Lists Are Counter Automata -- Lazy Shape Analysis -- Abstraction for Shape Analysis with Fast and Precise Transformers.Theoretical Computer Science and General Issues,2512-2029 ;4144Computer scienceSoftware engineeringMachine theoryArtificial intelligenceLogic designTheory of ComputationComputer Science Logic and Foundations of ProgrammingSoftware EngineeringFormal Languages and Automata TheoryArtificial IntelligenceLogic DesignComputer science.Software engineering.Machine theory.Artificial intelligence.Logic design.Theory of Computation.Computer Science Logic and Foundations of Programming.Software Engineering.Formal Languages and Automata Theory.Artificial Intelligence.Logic Design.004.24Ball Thomasedthttp://id.loc.gov/vocabulary/relators/edtJones Robert B(Robert Brent),1969-.edthttp://id.loc.gov/vocabulary/relators/edtCAV (Conference)BOOK996465602503316Computer Aided Verification772228UNISA