LEADER 07691nam 22008055 450 001 996466361703316 005 20200705005724.0 010 $a3-540-45657-0 024 7 $a10.1007/3-540-45657-0 035 $a(CKB)1000000000211984 035 $a(SSID)ssj0000697473 035 $a(PQKBManifestationID)11467625 035 $a(PQKBTitleCode)TC0000697473 035 $a(PQKBWorkID)10691891 035 $a(PQKB)10277031 035 $a(DE-He213)978-3-540-45657-5 035 $a(MiAaPQ)EBC3072795 035 $a(PPN)155209191 035 $a(EXLCZ)991000000000211984 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Aided Verification$b[electronic resource] $e14th International Conference, CAV 2002 Copenhagen, Denmark, July 27-31, 2002 Proceedings /$fedited by Ed Brinksma, Kim G. Larsen 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (X, 362 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2404 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43997-8 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Software Analysis and Model Checking -- The Quest for Efficient Boolean Satisfiability Solvers -- Invited Tutorials -- On Abstraction in Software Verification -- The Symbolic Approach to Hybrid Systems -- Infinite Games and Verification -- Symbolic Model Checking -- Symbolic Localization Reduction with Reconstruction Layering and Backtracking -- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions -- Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking -- Abstraction/Refinement and Model Checking -- Liveness with (0,1, ?)- Counter Abstraction -- Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking -- Automatic Abstraction Using Generalized Model Checking -- Compositional/Structural Verification -- Property Checking via Structural Analysis -- Conformance Checking for Models of Asynchronous Message Passing Software -- A Modular Checker for Multithreaded Programs -- Timing Analysis -- Automatic Derivation of Timing Constraints by Failure Analysis -- Deciding Separation Formulas with SAT -- Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling -- SAT Based Methods -- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT -- Applying SAT Methods in Unbounded Symbolic Model Checking -- SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques -- Semi-formal Bounded Model Checking -- Symbolic Model Checking -- Algorithmic Verification of Invalidation-Based Protocols -- Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving -- Automated Unbounded Verification of Security Protocols -- Tool Presentations -- Exploiting Behavioral Hierarchy for Efficient Model Checking -- IF-2.0: A Validation Environment for Component-Based Real-Time Systems -- The AVISS Security Protocol Analysis Tool -- SPeeDI ? A Verification Tool for Polygonal Hybrid Systems -- NuSMV 2: An OpenSource Tool for Symbolic Model Checking -- The d/dt Tool for Verification of Hybrid Systems -- Infinite Model Checking -- Model Checking Linear Properties of Prefix-Recognizable Systems -- Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking -- On Discrete Modeling and Model Checking for Nonlinear Analog Systems -- Compositional/Structural Verification -- Synchronous and Bidirectional Component Interfaces -- Interface Compatibility Checking for Software Modules -- Practical Methods for Proving Program Termination -- Extended Model Checking -- Evidence-Based Model Checking -- Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification -- Vacuum Cleaning CTL Formulae -- Tool Presentations -- CVC: A Cooperating Validity Checker -- ?Chek: A Multi-valued Model-Checker -- PathFinder: A Tool for Design Exploration -- Abstracting C with abC -- AMC: An Adaptive Model Checker -- Code Verification -- Temporal-Safety Proofs for Systems Code -- Regular Model Checking and Acceleration -- Extrapolating Tree Transformations -- Regular Tree Model Checking -- Compressing Transitions for Model Checking -- Model Reduction -- Canonical Prefixes of Petri Net Unfoldings -- State Space Reduction by Proving Confluence -- Fair Simulation Minimization. 330 $aThis volume contains the proceedings of the conference on Computer Aided V- i?cation (CAV 2002), held in Copenhagen, Denmark on July 27-31, 2002. CAV 2002 was the 14th in a series of conferences dedicated to the advancement of the theory and practice of computer-assisted formal analysis methods for software and hardware systems. The conference covers the spectrum from theoretical - sults to concrete applications, with an emphasis on practical veri?cation tools, including algorithms and techniques needed for their implementation. The c- ference has traditionally drawn contributions from researchers as well as prac- tioners in both academia and industry. This year we received 94 regular paper submissions out of which 35 were selected. Each submission received an average of 4 referee reviews. In addition, the CAV program contained 11 tool presentations selected from 16 submissions. For each tool presentation, a demo was given at the conference. The large number of tool submissions and presentations testi?es to the liveliness of the ?eld and its applied ?avor. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2404 606 $aComputers 606 $aComputer logic 606 $aSoftware engineering 606 $aMathematical logic 606 $aArtificial intelligence 606 $aSpecial purpose computers 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aSpecial Purpose and Application-Based Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I13030 615 0$aComputers. 615 0$aComputer logic. 615 0$aSoftware engineering. 615 0$aMathematical logic. 615 0$aArtificial intelligence. 615 0$aSpecial purpose computers. 615 14$aTheory of Computation. 615 24$aLogics and Meanings of Programs. 615 24$aSoftware Engineering. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 615 24$aSpecial Purpose and Application-Based Systems. 676 $a005.1 702 $aBrinksma$b Ed$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLarsen$b Kim G$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466361703316 996 $aComputer Aided Verification$9772228 997 $aUNISA