Improvements to the implementation of interpolant-based model checking

  • Authors:
  • João Marques-Silva

  • Affiliations:
  • IST/INESC-ID, Technical University of Lisbon, Portugal

  • Venue:
  • CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
  • Year:
  • 2005
  • Symbolic Model Checking without BDDs

    TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems

  • Symbolic Reachability Analysis Based on SAT-Solvers

    TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, more recently, in unbounded model checking (UMC). This paper addresses the utilization of interpolants in UMC and proposes two techniques for improving the original interpolant-based UMC algorithm. These techniques include improvements to the computation of interpolants, and redefining the organization of the unbounded model checking algorithm given the information extracted from interpolant computation.