Cimatti, Alessandro and Griggio, Alberto and Sebastiani, Roberto (2007) Efficient Interpolant Generation in Satisfiability Modulo Theories. UNSPECIFIED. (Unpublished)

Preview

PDF Download (340Kb) | Preview

Abstract

The problem of computing Craig Interpolants for propositional (SAT) formulas has recently received a lot of interest, mainly for its applications in formal verification. However, propositional logic is often not expressive enough for representing many interesting verification problems, which can be more naturally addressed in the framework of Satisfiability Modulo Theories, SMT. Although {some} works have addressed the topic of generating interpolants in SMT, the techniques and tools that are currently available have some limitations, and their performance still does not exploit the full power of current state-of-the-art SMT solvers. In this paper we try to close this gap. We present several techniques for interpolant generation in SMT which overcome the limitations of the current generators mentioned above, and which take full advantage of state-of-the-art SMT technology. These novel techniques can lead to substantial performance improvements wrt. the currently available tools. We support our claims with an extensive experimental evaluation of our implementation of the proposed techniques in the MathSAT SMT solver.

Available Versions of this Item

• Efficient Interpolant Generation in Satisfiability Modulo Theories. (deposited 19 Feb 2008)
  • Efficient Interpolant Generation in Satisfiability Modulo Theories. (deposited 23 Apr 2008)[Currently Displayed]

Actions (login required)