Verification, model checking, and abstract interpretation : 6th international conference, VMCAI 2005, Paris, France, January 17-19, 2005 : proceedings / Radhia Cousot (ed.).

By: VMCAI 2005 (2005 : Paris, France)
Contributor(s): Cousot, Radhia
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 3385.Publisher: Berlin ; New York : Springer, ©2005Description: 1 online resource (xi, 481 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 354024297X; 9783540242970; 3540305793; 9783540305798Other title: VMCAI 2005Subject(s): Computer programs -- Verification -- Congresses | Logiciels -- Vérification -- Congrès | COMPUTERS -- Software Development & Engineering -- Quality Assurance & Testing | Informatique | Computer programs -- Verification | Vérification de logiciels | Model-checking (Informatique)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Verification, model checking, and abstract interpretation.DDC classification: 005.14 LOC classification: QA76.76.V47 | V53 2005Online resources: Click here to access online
Contents:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

There are no comments for this item.

to post a comment.

Powered by Koha