On interpolation in decision procedures

  • Authors:
  • Maria Paola Bonacina;Moa Johansson

  • Affiliations:
  • Dipartimento di Informatica, Università degli Studi di Verona, Verona, Italy;Dipartimento di Informatica, Università degli Studi di Verona, Verona, Italy

  • Venue:
  • TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Interpolation means finding intermediate formulae between given formulae. When formulae decorate program locations, and describe sets of program states, interpolation may enable a program analyzer to discover information about intermediate locations and states. This mechanism has an increasing number of applications, that are relevant to program analysis and synthesis. We study interpolation in theorem proving decision procedures based on the DPLL (T) paradigm. We survey interpolation systems for DPLL, equality sharing and DPLL (T), reconstructing from the literature their completeness proofs, and clarifying the requirements for interpolation in the presence of equality.