000 04179nam a22005295i 4500
001 978-3-540-30579-8
003 DE-He213
005 20240730190506.0
007 cr nn 008mamaa
008 101220s2005 gw | s |||| 0|eng d
020 _a9783540305798
_9978-3-540-30579-8
024 7 _a10.1007/b105073
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aVerification, Model Checking, and Abstract Interpretation
_h[electronic resource] :
_b6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, Proceedings /
_cedited by Radhia Cousot.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXII, 483 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3385
505 0 _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 HybridSystems -- 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.
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science.
_99832
650 0 _aCompilers (Computer programs).
_93350
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aCompilers and Interpreters.
_931853
700 1 _aCousot, Radhia.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9142684
710 2 _aSpringerLink (Online service)
_9142685
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540242970
776 0 8 _iPrinted edition:
_z9783540806752
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3385
_9142686
856 4 0 _uhttps://doi.org/10.1007/b105073
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93281
_d93281