000 07007nam a22006135i 4500
001 978-3-540-45047-4
003 DE-He213
005 20240423132518.0
007 cr nn 008mamaa
008 121227s2000 gw | s |||| 0|eng d
020 _a9783540450474
_9978-3-540-45047-4
024 7 _a10.1007/10722167
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aComputer Aided Verification
_h[electronic resource] :
_b12th International Conference, CAV 2000 Chicago, IL, USA, July 15-19, 2000 Proceedings /
_cedited by E. Allen Emerson, A. Prasad Sistla.
250 _a1st ed. 2000.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2000.
300 _aX, 590 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1855
505 0 _aInvited Talks and Tutorials -- Keynote Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion -- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis -- Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation -- Invited Tutorial: Verification of Infinite-state and Parameterized Systems -- Regular Papers -- An Abstraction Algorithm for the Verification of Generalized C-Slow Designs -- Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits -- An Automata-Theoretic Approach to Reasoning about Infinite-State Systems -- Automatic Verification of Parameterized Cache Coherence Protocols -- Binary Reachability Analysis of Discrete Pushdown Timed Automata -- Boolean Satisfiability with Transitivity Constraints -- Bounded Model Construction for Monadic Second-Order Logics -- Building Circuits from Relations -- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking -- On the Completeness of Compositional Reasoning -- Counterexample-Guided Abstraction Refinement -- Decision Procedures for Inductive Boolean Functions Based on Alternating Automata -- Detecting Errors Before Reaching Them -- A Discrete Strategy Improvement Algorithm for Solving Parity Games -- Distributing Timed Model Checking — How the Search Order Matters -- Efficient Algorithms for Model Checking Pushdown Systems -- Efficient Büchi Automata from LTL Formulae -- Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods -- Efficient Reachability Analysis of Hierarchical Reactive Machines -- Formal Verification of VLIW Microprocessors with Speculative Execution -- Induction in Compositional Model Checking -- Liveness and Acceleration in Parameterized Verification -- Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm -- Model Checking Continuous-Time Markov Chains by Transient Analysis -- Model-Checking for Hybrid Systems by Quotienting and Constraints Solving -- Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification -- Regular Model Checking -- Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems -- Syntactic Program Transformations for Automatic Abstraction -- Temporal-logic Queries -- Are Timed Automata Updatable? -- Tuning SAT Checkers for Bounded Model Checking -- Unfoldings of Unbounded Petri Nets -- Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification -- Verifying Advanced Microarchitectures that Support Speculation and Exceptions -- Tool Papers -- FoCs – Automatic Generation of Simulation Checkers from Formal Specifications -- IF: A Validation Environment for Timed Asynchronous Systems -- Integrating WS1S with PVS -- PET: An Interactive Software Testing Tool -- A Proof-Carrying Code Architecture for Java -- The Statemate Verification Environment -- TAPS: A First-Order Verifier for Cryptographic Protocols -- VINAS-P: A Tool for TraceTheoretic Verification of Timed Asynchronous Circuits -- XMC: A Logic-Programming-Based Verification Toolset.
520 _aThis volume contains the proceedings of the 12th International Conference on Computer Aided Veri?cation (CAV 2000) held in Chicago, Illinois, USA during 15-19 July 2000. The CAV conferences are devoted to the advancement of the theory and practice of formal methods for hardware and software veri?cation. The con- rence covers the spectrum from theoretical foundations to concrete applications, with an emphasis on veri?cation algorithms, methods, and tools together with techniques for their implementation. The conference has traditionally drawn contributions from both researchers and practitioners in academia and industry. This year 91 regular research papers were submitted out of which 35 were - cepted, while 14 brief tool papers were submitted, out of which 9 were accepted for presentation. CAV included two invited talks and a panel discussion. CAV also included a tutorial day with two invited tutorials. Many industrial companies have shown a serious interest in CAV, ranging from usingthe presented technologies in their business to developing and m- keting their own formal veri?cation tools. We are very proud of the support we receive from industry. CAV 2000 was sponsored by a number of generous andforward-lookingcompaniesandorganizationsincluding:CadenceDesign- stems, IBM Research, Intel, Lucent Technologies, Mentor Graphics, the Minerva Center for Veri?cation of Reactive Systems, Siemens, and Synopsys. TheCAVconferencewasfoundedbyitsSteeringCommittee:EdmundClarke (CMU), Bob Kurshan (Bell Labs), Amir Pnueli (Weizmann), and Joseph Sifakis (Verimag).
650 0 _aSoftware engineering.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aComputers, Special purpose.
650 0 _aArtificial intelligence.
650 1 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aSpecial Purpose and Application-Based Systems.
650 2 4 _aArtificial Intelligence.
700 1 _aEmerson, E. Allen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSistla, A. Prasad.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540677703
776 0 8 _iPrinted edition:
_z9783662186701
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1855
856 4 0 _uhttps://doi.org/10.1007/10722167
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188576
_d188576