Automatic Abstraction without Counterexamples

  • Kenneth L. McMillan
  • Nina Amla
Conference paper

DOI: 10.1007/3-540-36577-X_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2619)
Cite this paper as:
McMillan K.L., Amla N. (2003) Automatic Abstraction without Counterexamples. In: Garavel H., Hatcliff J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg

Abstract

A method of automatic abstraction is presented that uses proofs of unsatisfiability derived from SAT-based bounded model checking as a guide to choosing an abstraction for unbounded model checking. Unlike earlier methods, this approach is not based on analysis of abstract counterexamples. The performance of this approach on benchmarks derived from microprocessor verification indicates that SAT solvers are quite effective in eliminating logic that is not relevant to a given property. Moreover, benchmark results suggest that when bounded model checking successfully terminates, and the problem is unsatisfiable, the number of state variables in the proof of unsatisfiability tends to be small. In almost all cases tested, when bounded model checking succeeded, unbounded model checking of the resulting abstraction also succeeded.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Kenneth L. McMillan
    • 1
  • Nina Amla
    • 1
  1. 1.Cadence Design SystemsUSA

Personalised recommendations