LEADER 03948nam 2200541 a 450 001 9910483354603321 005 20200520144314.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 $a20041202d2005 uy 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 /$fRadhia Cousot (ed.) 205 $a1st ed. 2005. 210 $aBerlin ;$aNew York $cSpringer$dc2005 215 $a1 online resource (XII, 483 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$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$aLecture notes in computer science ;$v3385. 517 3 $aVMCAI 2005 606 $aComputer programs$xVerification$vCongresses 615 0$aComputer programs$xVerification 676 $a005.1/4 701 $aCousot$b Radhia$01752269 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483354603321 996 $aVerification, model checking, and abstract interpretation$94195788 997 $aUNINA