Advertisement

Proofs, Interpolants, and Relevance Heuristics

(HVC 2008 Award Winner)
  • Ken McMillan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5394)

Abstract

The technique of Craig interpolation provides a means of extracting from a proof about a bounded execution of a system the necessary information to construct a proof about unbounded executions. This allows us to exploit the relevance heuristics that are built into modern SAT solvers and SAT-based decision procedures to scale model checking to larger systems.

This talk will cover applications of Craig interpolation in various domains, including hardware verification using propositional logic, and software verification using first-order logic.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ken McMillan
    • 1
  1. 1.Cadence Berkeley LabsUSA

Personalised recommendations