06048nam 22006135i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003100137050001700168072001500185072001600200072002300216072002300239082001700262245008500279264006100364300003400425336002600459337002600485338003600511347002400547490005800571505341800629520063604047650002204683650003104705650002604736650001504762650002004777650002404797650002904821650002204850650002704872650003704899650002604936650004504962650005105007650004605058700002905104710003405133773002005167776003605187830005805223856004405281912001405325912001405339912001405353942001205367950003805379999001705417978-3-540-69195-2DE-He21320170515111448.0cr nn 008mamaa121227s1997 gw | s |||| 0|eng d a97835406919529978-3-540-69195-27 a10.1007/3-540-63166-62doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.015122310aComputer Aided Verificationh[electronic resource] :bcedited by Orna Grumberg. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1997. aXII, 492 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v12540 aPractical challenges for industrial formal verification tools -- Formal verification of digital systems, from ASICs to HW/SW codesign $1 (Ba pragmatic approach -- The industrial success of verification tools based on stęalmarck's method -- Formal verification $1 (BApplications & case studies -- Automatic abstraction techniques for propositional ?-calculus model checking -- A compositional rule for hardware design refinement -- Module checking revisited -- Using compositional preorders in the verification of sliding window protocol -- An efficient decision procedure for the theory of fixed-sized bit-vectors -- Construction of abstract state graphs with PVS -- Verification of a chemical process leak test procedure -- Automatic datapath extraction for efficient usage of HDD -- An n log n algorithm for online BDD refinement -- Weak bisimulation for fully probabilistic processes -- Towards a mechanization of cryptographic protocol verification -- Efficient model checking using tabled resolution -- Containment of regular languages in non-regular timing diagram languages is decidable -- An improved reachability analysis method for strongly linear hybrid systems (extended abstract) -- Some progress in the symbolic verification of timed automata -- STARI: A case study in compositional and hierarchical timing verification -- A provably correct embedded verifier for the certification of safety critical software -- Model checking in a microprocessor design project -- Some thoughts on statecharts, 13 years later -- On-the-fly model checking under fairness that exploits symmetry -- Exploiting symmetry when verifying transistor-level circuits by symbolic trajectory evaluation -- Parallelizing the Mur? verifier -- A new heuristic for bad cycle detection using BDDs -- Efficient detection of vacuity in ACTL formulas -- Model checking and transitive-closure logic -- Boolean and 2-adic numbers based techniques for verifying synchronous designs -- Programs with quasi-stable channels are effectively recognizable -- Combining constraint solving and symbolic model checking for a class of systems with non-linear constraints -- Relaxed visibility enhances partial order reduction -- Partial-order reduction in symbolic state space exploration -- Deadlock checking using net unfoldings -- Trace table based approach for pipelined microprocessor verification -- On combining formal and informal verification -- Efficient modeling of memory arrays in symbolic simulation -- Symbolic model checking of infinite state systems using presburger arithmetic -- Parametrized verification of linear networks using automata as invariants -- Symbolic model checking with rich assertional languages -- The invariant checker: Automated deductive verification of reactive systems -- The PEP tool -- TermiLog: A system for checking termination of queries to logic programs -- Mosel: A sound and efficient tool for M2L(Str) -- The verus tool: A quantitative approach to the formal verification of real-time systems -- Uppaal: Status & developments -- HyTech: A model checker for hybrid systems -- SMC: A symmetry based model checker for verification of liveness properties -- ?cke $1 (BEfficient ?-calculus model checking -- Prod 3.2 An advanced tool for efficient reachability analysis -- VeriSoft: A tool for the automatic analysis of concurrent reactive software -- RuleBase: Model checking at IBM.s aThis book constitutes the strictly refereed proceedings of the 9th International Conference on Computer Aided Verification, CAV '97, held in Haifa, Israel, in June 1997. The volume presents 34 revised full papers selected from a total of 84 submissions. Also included are 7 invited contributions as well as 12 tool descriptions. The volume is dedicated to the theory and practice of computer aided formal methods for software and hardware verification, with an emphasis on verification tools and algorithms and the techniques needed for their implementation. The book is a unique record documenting the recent progress in the area. 0aComputer science. 0aSpecial purpose computers. 0aSoftware engineering. 0aComputers. 0aComputer logic. 0aMathematical logic. 0aArtificial intelligence.14aComputer Science.24aTheory of Computation.24aLogics and Meanings of Programs.24aSoftware Engineering.24aMathematical Logic and Formal Languages.24aSpecial Purpose and Application-Based Systems.24aArtificial Intelligence (incl. Robotics).1 aGrumberg, Orna.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540631668 0aLecture Notes in Computer Science,x0302-9743 ;v125440uhttp://dx.doi.org/10.1007/3-540-63166-6 aZDB-2-SCS aZDB-2-LNC aZDB-2-BAE 2ddccEB aComputer Science (Springer-11645) c14329d14329