LEADER 05223nam 22008295 450 001 9910484040303321 005 20251226200052.0 010 $a3-319-11936-2 024 7 $a10.1007/978-3-319-11936-6 035 $a(CKB)3710000000269674 035 $a(SSID)ssj0001372538 035 $a(PQKBManifestationID)11881970 035 $a(PQKBTitleCode)TC0001372538 035 $a(PQKBWorkID)11304519 035 $a(PQKB)10145183 035 $a(DE-He213)978-3-319-11936-6 035 $a(MiAaPQ)EBC6295875 035 $a(MiAaPQ)EBC5595400 035 $a(Au-PeEL)EBL5595400 035 $a(OCoLC)1076252663 035 $a(PPN)182097668 035 $a(EXLCZ)993710000000269674 100 $a20141024d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomated Technology for Verification and Analysis $e12th International Symposium, ATVA 2014, Sydney, Australia, November 3-7, 2014, Proceedings /$fedited by Franck Cassez, Jean-Francois Raskin 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XXIV, 430 p. 109 illus.) 225 1 $aProgramming and Software Engineering,$x2945-9168 ;$v8837 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-319-11935-4 327 $aVerifying Communicating Multi-pushdown Systems via Split-Width -- Booster: An Acceleration-Based Verification Framework for Array Programs -- A Bounded Model Checker for SPARK Programs -- Acceleration of Affine Hybrid Transformations -- A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol -- Quantitative Verification of Weighted Kripke Structures -- Formal Safety Assessment via Contract-Based Design -- Verification of Markov Decision Processes Using Learning Algorithms -- Test Coverage Estimation Using Threshold Accepting -- On Time with Minimal Expected Cost! -- Fast Debugging of PRISM Models -- ACME: Automata with Counters, Monoids and Equivalence (Tool Paper).-Modelling and Analysis of Markov Reward Automata -- Extensional Crisis and Proving Identity -- Deciding Entailments in Inductive Separation Logic with Tree Automata -- Liveness Analysis for Parameterised Boolean Equation Systems -- Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata -- PeCAn: Compositional Verification of Petri Nets Made Easy -- The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems -- Efficiently and Completely Verifying Synchronized Consistency Models -- Symmetry Reduction in Infinite Games with Finite Branching -- Incremental Encoding and Solving of Cardinality Constraints -- Formal Verification of Skiplists with Arbitrary Many Levels -- Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom -- A Game-Theoretic Approach to Simulation of Data-Parameterized Systems -- Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters -- Symbolic Memory with Pointers -- Trace Abstraction Refinement for Timed Automata -- Statistically Sound Verification and Optimization for Complex Systems. 330 $aThis book constitutes the proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014, held in Sydney, Australia, in November 2014. The 29 revised papers presented in this volume were carefully reviewed and selected from 76 submissions. They show current research on theoretical and practical aspects of automated analysis, verification and synthesis by providing an international forum for interaction among the researchers in academia and industry. 410 0$aProgramming and Software Engineering,$x2945-9168 ;$v8837 606 $aSoftware engineering 606 $aComputer programming 606 $aComputer networks 606 $aComputer science 606 $aCompilers (Computer programs) 606 $aMachine theory 606 $aSoftware Engineering 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 606 $aFormal Languages and Automata Theory 615 0$aSoftware engineering. 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aComputer science. 615 0$aCompilers (Computer programs). 615 0$aMachine theory. 615 14$aSoftware Engineering. 615 24$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 615 24$aFormal Languages and Automata Theory. 676 $a004 702 $aCassez$b Franck$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRaskin$b Jean-Francois$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484040303321 996 $aAutomated Technology for Verification and Analysis$9772478 997 $aUNINA