LEADER 04581nam 22006495 450 001 996466042903316 005 20230314072151.0 010 $a3-642-39799-9 024 7 $a10.1007/978-3-642-39799-8 035 $a(CKB)3710000000002650 035 $a(DE-He213)978-3-642-39799-8 035 $a(SSID)ssj0000962594 035 $a(PQKBManifestationID)11526970 035 $a(PQKBTitleCode)TC0000962594 035 $a(PQKBWorkID)10988854 035 $a(PQKB)11780851 035 $a(MiAaPQ)EBC3093115 035 $a(PPN)172428629 035 $a(EXLCZ)993710000000002650 100 $a20130711d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputer Aided Verification$b[electronic resource] $e25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings /$fedited by Natasha Sharygina, Helmut Veith 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XXII, 1015 p. 237 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8044 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-39798-0 327 $aAutomata Networks -- Model-Checking Signal Transduction Networks through Decreasing Reachability Sets -- TTP: Tool for Tumor Progression -- Exploring Parameter Space of Stochastic Biochemical Systems using Quantitative Model Checking -- Parameterized Verification of Asynchronous Shared-Memory Systems -- Partial Orders for Efficient BMC of Concurrent Software -- Incremental, Inductive Coverability -- Automatic linearizability proofs of concurrent objects with cooperating -- Updates -- Duet: Static Analysis for Unbounded Parallelism -- SVA and PSL Local Variables -- A Practical Approach -- Formal Verification of Hardware Synthesis -- CacBDD: A BDD Package with Dynamic Cache Management -- Distributed Explicit State Model Checking of Deadlock Freedom -- Exponential-Condition-Based Barrier Certificate Generation for Safety -- Verification of Hybrid Systems -- Efficient Robust Monitoring for STL -- Abstraction based Model-Checking of Stability of Hybrid Systems -- Faster Algorithms for Markov Decision Processes with Low Tree width -- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis -- Importance Splitting for Statistical Model Checking Rare Properties -- Minimal Sets over Monotone Predicates in Boolean Formulae -- Smten: Automatic Translation of High-level Symbolic Computations into SMT Queries -- QUAIL: a quantitative security analyzer for imperative code -- Effectively Propositional Reasoning about Reachability in Linked Data Structures -- Learning Universally Quantified Invariants of Linear Data Structures -- GOAL for Games, Omega-Automata, and Logics -- Efficient synthesis for concurrency using semantics-preserving Transformations. 330 $aThis book constitutes the thoroughly refereed proceedings of the 25th International Conference on Computer Aided Verification, CAV 2013 held in St. Petersburg, Russia in July 2013. The 54 regular and 16 tool papers presented were carefully selected from 209 submissions. The papers are organized in topical sections on biology, concurrency, hardware, hybrid systems, interpolation, loops and termination, new domains, probability and statistics, SAT and SMZ, security, shape analysis, synthesis, and time. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8044 606 $aComputer science 606 $aSoftware engineering 606 $aComputers, Special purpose 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 606 $aSpecial Purpose and Application-Based Systems 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aComputers, Special purpose. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 615 24$aSpecial Purpose and Application-Based Systems. 676 $a005.14 702 $aSharygina$b Natasha$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVeith$b Helmut$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466042903316 996 $aComputer Aided Verification$9772228 997 $aUNISA