A Parametric Interpolation Framework for First-Order Theories
Craig interpolation is successfully used in both hardware and software model checking. Generating good interpolants, and hence automatically determining the quality of interpolants is however a very hard problem, requiring non-trivial reasoning in first-order theories. An important class of state-of-the-art interpolation algorithms is based on recursive procedures that generate interpolants from refutations of unsatisfiable conjunctions of formulas. We analyze this type of algorithms and develop a theoretical framework, called a parametric interpolation framework, for arbitrary first-order theories and inference systems. As interpolation-based verification approaches depend on the quality of interpolants, our method can be used to derive interpolants of different structure and strength, with or without quantifiers, from the same proof. We show that some well-known interpolation algorithms are instantiations of our framework.
KeywordsModel Check Inference System Interpolation Algorithm Interpolation Procedure Bound Model Check
Unable to display preview. Download preview PDF.
- 1.A Parametric Interpolation Framework for First-Order Theories - Extended Version, http://www.inf.usi.ch/phd/rollini/KRS13ext.pdf
- 5.Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from Proofs. In: POPL, pp. 232–244 (2004)Google Scholar
- 6.Hoder, K., Kovács, L., Voronkov, A.: Playing in the Grey area of Proofs. In: POPL, pp. 259–272 (2012)Google Scholar