Relative Completeness of Abstraction Refinement for Software Model Checking

  • Thomas Ball
  • Andreas Podelski
  • Sriram K. Rajamani
Conference paper

DOI: 10.1007/3-540-46002-0_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2280)
Cite this paper as:
Ball T., Podelski A., Rajamani S.K. (2002) Relative Completeness of Abstraction Refinement for Software Model Checking. In: Katoen JP., Stevens P. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Lecture Notes in Computer Science, vol 2280. Springer, Berlin, Heidelberg

Abstract

Automated methods for an undecidable class of verification problems cannot be complete (terminate for every correct program). We therefore consider a new kind of quality measure for such methods, which is completeness relative to a (powerful but unrealistic) oraclebased method. More precisely, we ask whether an often implemented method known as “software model checking with abstraction refinement” is complete relative to fixpoint iteration with “oracle-guided” widening. We show that whenever backward fixpoint iteration with oracle-guided widening succeeds in proving a property π (for some sequence of widenings determined by the oracle) then software model checking with a particular form of backward refinement will succeed in proving π. Intuitively, this means that the use of fixpoint iteration over abstractions and a particular backwards refinement of the abstractions has the effect of exploring the entire state space of all possible sequences of widenings.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Thomas Ball
    • 1
  • Andreas Podelski
    • 2
  • Sriram K. Rajamani
    • 1
  1. 1.Microsoft ResearchUSA
  2. 2.Max-Planck-Institut für InformatikGermany

Personalised recommendations