Flexible Interpolation with Local Proof Transformations

Abstract:

Model checking based on Craig's interpolants ultimately relies on efficient engines, such as SMT-solvers, to log proofs of unsatisfiability and to derive the desired interpolant by means of a set of algorithms known in literature. These algorithms, however, are designed for proofs that do not contain mixed predicates. In this paper we present a technique for transforming the propositional proof produced by an SMT-solver in such a way that mixed predicates are eliminated. We show a number of cases in which mixed predicates arise as a consequence of state-of-the-art solving procedures (e.g. lemma on demand, theory combination, etc.). In such cases our technique can be applied to allow the application of known interpolation algorithms. We demonstrate with a set of experiments that our approach is viable.

Notes:

• BibTex

@inproceedings { BRST10,
	title = {Flexible Interpolation with Local Proof Transformations},
	booktitle = {International Conference of Computer Aided Design (ICCAD)},
	year = {2010},
	note = {to appear},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {San Jose, USA},
	URL = {http://dx.doi.org/10.1109/ICCAD.2010.5654297},
	author = {Roberto Bruttomesso and  Simone Fulvio Rollini and  Natasha Sharygina and  Aliaksei Tsitovich}
}