Verification, Model Checking, and Abstract Interpretation

8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings

Byron Cook, Andreas Podelski (Herausgeber)

Buch | Softcover

XI, 395 Seiten

2007 | 2007
Springer Berlin (Verlag)
978-3-540-69735-0 (ISBN)

Artikel merken

The book constitutes the refereed proceedings of the 7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2007, held in Nice, France in January 2007. This event was co-located with the Symposium on Principles of Programming Languages (POPL 2007). The 21 revised full papers presented together with three invited lectures and three invited tutorials were carefully reviewed and selected from a total of 85 submissions.

Invited Talk.- DIVINE: DIscovering Variables IN Executables.- Session 1.- Verifying Compensating Transactions.- Model Checking Nonblocking MPI Programs.- Model Checking Via ?CFA.- Using First-Order Theorem Provers in the Jahob Data Structure Verification System.- Invited Tutorial.- Interpolants and Symbolic Model Checking.- Session 2.- Shape Analysis of Single-Parent Heaps.- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures.- On Flat Programs with Lists.- Invited Talk.- Automata-Theoretic Model Checking Revisited.- Session 3.- Language-Based Abstraction Refinement for Hybrid System Verification.- More Precise Partition Abstractions.- The Spotlight Principle.- Lattice Automata.- Invited Tutorial.- Learning Algorithms and Formal Verification (Invited Tutorial).- Session 4.- Constructing Specialized Shape Analyses for Uniform Change.- Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning.- Automated Verification of Shape and Size Properties Via Separation Logic.- Invited Talk.- Towards Shape Analysis for Device Drivers.- Session 5.- An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints.- Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes.- Symmetry and Completeness in the Analysis of Parameterized Systems.- Better Under-Approximation of Programs by Hiding Variables.- Invited Tutorial.- The Constraint Database Approach to Software Verification.- Session 6.- Constraint Solving for Interpolation.- Assertion Checking Unified.- Invariant Synthesis for Combined Theories.

Erscheint lt. Verlag	3.1.2007
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XI, 395 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	620 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Themenwelt	Informatik ► Theorie / Studium ► Compilerbau
Schlagworte	abstarct interpretation • abstract domains • Abstraction • algorithms • Constraint • data structure • data structures • debugging techniques • deductive methods • formal methods • Formal Verification • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • higher-order languages • Java • Model Checking • Optimization • program analysis • program invariants • programming • programming calculi • Programming language • Program Semantics • program validation • Program verification • Refinement • Static Analysis • Temporal Logics • Type Systems
ISBN-10	3-540-69735-7 / 3540697357
ISBN-13	978-3-540-69735-0 / 9783540697350
Zustand	Neuware