Accelerating interpolation-based model-checking

  • Authors:

  • Nicolas Caniart;Emmanuel Fleury;Jérôme Leroux;Marc Zeitoun

  • Affiliations:

  • LaBRI, Université Bordeaux, CNRS, UMR, Talence Cedex, France;LaBRI, Université Bordeaux, CNRS, UMR, Talence Cedex, France;LaBRI, Université Bordeaux, CNRS, UMR, Talence Cedex, France;LaBRI, Université Bordeaux, CNRS, UMR, Talence Cedex, France

  • Venue:
  • TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Interpolation-based model-checking and acceleration techniques have been widely proved successful and efficient for reachability checking. Surprisingly, these two techniques have never been combined to strengthen each other. Intuitively, acceleration provides under-approximation of the reachability set by computing the exact effect of some control-flow cycles and combining them with other transitions. On the other hand, interpolation-based model-checking is refining an over-approximation of the reachable states based on spurious error-traces. The goal of this paper is to combine acceleration techniques with interpolationbased model-checking at the refinement stage. Our method, called "interpolant acceleration", helps to refine the abstraction, ruling out not only a single spurious error-trace but a possibly infinite set of error-traces obtained by any unrolling of its cycles. Interpolant acceleration is also proved to strictly enlarge the set of transformations that can be usually handled by acceleration techniques.