Book Volume 3385 2005

Verification, Model Checking, and Abstract Interpretation

6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005. Proceedings


ISBN: 978-3-540-24297-0 (Print) 978-3-540-30579-8 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Paper

    1. Chapter

      Pages 1-24

      Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming

  3. Numerical Abstraction

    1. Chapter

      Pages 25-41

      Scalable Analysis of Linear Systems Using Mathematical Programming

    2. Chapter

      Pages 42-58

      The Arithmetic-Geometric Progression Abstract Domain

    3. Chapter

      Pages 59-77

      An Overview of Semantics for the Validation of Numerical Programs

  4. Invited Talk

    1. Chapter

      Pages 78-78

      The Verifying Compiler, a Grand Challenge for Computing Research

  5. Verification I

    1. Chapter

      Pages 79-96

      Checking Herbrand Equalities and Beyond

    2. Chapter

      Pages 97-112

      Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs

    3. Chapter

      Pages 113-129

      Termination of Polynomial Programs

    4. Chapter

      Pages 130-145

      Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement

  6. Invited Talk

    1. Chapter

      Pages 146-146

      Abstraction for Liveness

  7. Heap and Shape Analysis

    1. Chapter

      Pages 147-163

      Abstract Interpretation with Alien Expressions and Heap Structures

    2. Chapter

      Pages 164-180

      Shape Analysis by Predicate Abstraction

    3. Chapter

      Pages 181-198

      Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists

    4. Chapter

      Pages 199-215

      Purity and Side Effect Analysis for Java Programs

  8. Abstract Model Checking

    1. Chapter

      Pages 216-232

      Automata as Abstractions

    2. Chapter

      Pages 233-249

      Don’t Know in the μ-Calculus

    3. Chapter

      Pages 250-266

      Model Checking of Systems Employing Commutative Functions

  9. Model Checking

    1. Chapter

      Pages 267-281

      Weak Automata for the Linear Time μ-Calculus

    2. Chapter

      Pages 282-297

      Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties

    3. Chapter

      Pages 298-312

      Minimizing Counterexample with Unit Core Extraction and Incremental SAT

previous Page of 2