04427nam 22006255 450 99646605570331620230222172909.03-540-30579-310.1007/b105073(CKB)1000000000212683(SSID)ssj0000267099(PQKBManifestationID)11204583(PQKBTitleCode)TC0000267099(PQKBWorkID)10305987(PQKB)11577026(DE-He213)978-3-540-30579-8(MiAaPQ)EBC3068274(PPN)123091063(Association for Computing Machinery)10.5555/2131753(EXLCZ)99100000000021268320101220d2005 u| 0engurnn|008mamaatxtccrVerification, Model Checking, and Abstract Interpretation 6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, Proceedings /edited by Radhia Cousot1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (XII, 483 p.) Theoretical Computer Science and General Issues,2512-2029 ;3385Bibliographic Level Mode of Issuance: Monograph3-540-24297-X Includes bibliographical references and index.Invited 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.Theoretical Computer Science and General Issues,2512-2029 ;3385VMCAI'05Software engineeringComputer scienceCompilers (Computer programs)Software EngineeringComputer Science Logic and Foundations of ProgrammingCompilers and InterpretersSoftware engineering.Computer science.Compilers (Computer programs).Software Engineering.Computer Science Logic and Foundations of Programming.Compilers and Interpreters.005.1/4Cousot Radhiaedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466055703316Verification, Model Checking, and Abstract Interpretation2593983UNISA