LEADER 04427nam 22006255 450 001 996466055703316 005 20230222172909.0 010 $a3-540-30579-3 024 7 $a10.1007/b105073 035 $a(CKB)1000000000212683 035 $a(SSID)ssj0000267099 035 $a(PQKBManifestationID)11204583 035 $a(PQKBTitleCode)TC0000267099 035 $a(PQKBWorkID)10305987 035 $a(PQKB)11577026 035 $a(DE-He213)978-3-540-30579-8 035 $a(MiAaPQ)EBC3068274 035 $a(PPN)123091063 035 $a(Association for Computing Machinery)10.5555/2131753 035 $a(EXLCZ)991000000000212683 100 $a20101220d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aVerification, Model Checking, and Abstract Interpretation $e6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, Proceedings /$fedited by Radhia Cousot 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XII, 483 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3385 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-24297-X 320 $aIncludes bibliographical references and index. 327 $aInvited Paper -- Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming -- Numerical Abstraction -- Scalable Analysis of Linear Systems Using Mathematical Programming -- The Arithmetic-Geometric Progression Abstract Domain -- An Overview of Semantics for the Validation of Numerical Programs -- Invited Talk -- The Verifying Compiler, a Grand Challenge for Computing Research -- Verification I -- Checking Herbrand Equalities and Beyond -- Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs -- Termination of Polynomial Programs -- Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement -- Invited Talk -- Abstraction for Liveness -- Heap and Shape Analysis -- Abstract Interpretation with Alien Expressions and Heap Structures -- Shape Analysis by Predicate Abstraction -- Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists -- Purity and Side Effect Analysis for Java Programs -- Abstract Model Checking -- Automata as Abstractions -- Don?t Know in the ?-Calculus -- Model Checking of Systems Employing Commutative Functions -- Model Checking -- Weak Automata for the Linear Time ?-Calculus -- Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties -- Minimizing Counterexample with Unit Core Extraction and Incremental SAT -- I/O Efficient Directed Model Checking -- Applied Abstract Interpretation -- Verification of an Error Correcting Code by Abstract Interpretation -- Information Flow Analysis for Java Bytecode -- Cryptographic Protocol Analysis on Real C Code -- Bounded Model Checking -- Simple Is Better: Efficient Bounded Model Checking for Past LTL -- Optimizing Bounded Model Checking for Linear Hybrid Systems -- Verification II -- Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives -- Generalized Typestate Checking for Data Structure Consistency -- On the Complexity of Error Explanation -- Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3385 517 3 $aVMCAI'05 606 $aSoftware engineering 606 $aComputer science 606 $aCompilers (Computer programs) 606 $aSoftware Engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aCompilers and Interpreters 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aCompilers (Computer programs). 615 14$aSoftware Engineering. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aCompilers and Interpreters. 676 $a005.1/4 702 $aCousot$b Radhia$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466055703316 996 $aVerification, Model Checking, and Abstract Interpretation$92593983 997 $aUNISA