Verification, Model Checking, and Abstract Interpretation: 6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, ProceedingsRadhia Cousot This volume contains the papers accepted for presentation at the 6th Inter- tional Conference on Veri?cation, Model Checking and Abstract Interpretation (VMCAI 2005), which was held January 17-19, 2005 in Paris, France. VMCAI provides a forum for researchers from the communities of veri?- tion, model checking, and abstract interpretation, facilitating interaction, cro- fertilization, and advancement of hybrid methods that combine the three areas. With the growing need for formal methods to reason about complex, in?ni- state, and embedded systems, such hybrid methods are bound to be of great importance. VMCAI 2005 received 92 submissions. Each paper was carefully reviewed, being judged according to scienti?c quality, originality, and relevance to the symposium topics. Following online discussions, the program committee met in ́ Paris, France, attheEcoleNormaleSup ́ erieureonOctober30,2004, andselected 27 papers. In addition to the contributed papers, this volume includes contributions by outstanding invited speakers: ́ - Patrick Cousot (Ecole Normale Sup ́ erieure, Paris), Proving Program Inva- ance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semide?nite Programming; - C.A.R. Hoare (Microsoft Research, Cambridge), The Verifying Compiler, a Grand Challenge for Computing Research; - Amir Pnueli (New York University and Weizmann Institute of Science), - straction for Liveness. The VMCAI 2005 program included an invited tutorial by Sriram K. Ra- mani (Microsoft Research, Redmond) on Model Checking, Abstraction and S- bolic Execution for Software. VMCAI 2005 was followed by workshops on Automatic Tools for Veri?- tion, Abstract Interpretation of Object-Oriented Languages, and Numerical & Symbolic Abstract Domains. |
Contents
Invited Paper | 1 |
Numerical Abstraction | 25 |
The ArithmeticGeometric Progression Abstract Domain | 42 |
An Overview of Semantics for the Validation of Numerical Programs | 59 |
Invited Talk | 78 |
Static Analysis by Abstract Interpretation | 97 |
Termination of Polynomial Programs | 113 |
Verifying Safety of a Token Coherence Implementation | 130 |
Model Checking of Systems Employing Commutative Functions A Prasad Sistla Min Zhou and Xiaodong Wang | 250 |
Weak Automata for the Linear Time μCalculus | 267 |
Model Checking for Process Rewrite Systems | 282 |
Minimizing Counterexample with Unit Core Extraction | 298 |
IO Efficient Directed Model Checking | 313 |
Applied Abstract Interpretation | 330 |
Information Flow Analysis for Java Bytecode Samir Genaim and Fausto Spoto | 346 |
Cryptographic Protocol Analysis on Real C Code | 363 |
Invited Talk | 146 |
Heap and Shape Analysis | 147 |
Shape Analysis by Predicate Abstraction | 164 |
Predicate Abstraction and Canonical Abstraction for SinglyLinked Lists | 181 |
Purity and Side Effect Analysis for Java Programs | 199 |
Automata as Abstractions | 216 |
Dont Know in the μCalculus | 233 |
Bounded Model Checking | 380 |
Optimizing Erika AbrahámBounded Model Checking for Linear Hybrid Systems Bernd Becker Felix Klaedtke and Martin Steffen | 396 |
Verification II | 413 |
Generalized Typestate Checking for Data Structure Consistency | 430 |
On the Complexity of Error Explanation | 448 |
Efficiently Verifiable Conditions for DeadlockFreedom | 465 |
Other editions - View all
Verification, Model Checking, and Abstract Interpretation: 6th International ... Radhia Cousot No preview available - 2005 |
Verification, Model Checking, and Abstract Interpretation: 6th International ... Radhia Cousot No preview available - 2005 |
Common terms and phrases
abstract domain abstract interpretation algorithm analyze assertion assignment assume automata automatic differentiation automaton base domain bi-simulation boolean canonical abstraction clauses Computer Aided Verification Computer Science concrete condition congruence-closure conjunction consider constraints counterexample Cousot data structures deadlock defined Definition denote e-graph edge encoding equivalent error example execution expression finite fixpoint formula given global graph guards heap Herbrand implementation infinite initial input integer invariant iteration Java bytecode Kripke structure language Lemma linear LNCS logic loop loop invariant Mealy machine method model checking node operators optimization output parameter path Player polynomial predicate abstraction problem Proc Proof properties Proposition protocol prove rank function reachable refinement result Section semantics semidefinite programming simulation Software Springer Springer-Verlag static analysis symbolic values termination Theorem tion transition relation transition systems typestate update V₁ variables verification VHDL VMCAI