Vinter: A Vampire-Based Tool for Interpolation
- 492 Downloads
This paper describes the Vinter tool for extracting interpolants from proofs and minimising such interpolants using various measures. Vinter takes an input problem written in either SMT-LIB or TPTP syntax, generates so called local proofs and then uses a technique of playing in the grey areas of proofs to find interpolants minimal with respect to various measures. Proofs are found using either Z3 or Vampire, solving pseudo-boolean optimisation is delegated to Yices, while localising proofs and generating minimal interpolants is done by Vampire. We describe the use of Vinter and give experimental results on problems from bounded model checking.
Unable to display preview. Download preview PDF.
- 1.Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2010), www.SMT-LIB.org
- 7.Hoder, K., Kovacs, L., Voronkov, A.: Playing in the Grey Area of Proofs. In: Proc. of POPL, pp. 259–272 (2012)Google Scholar
- 12.McMillan, K.L.: Interpolants from Z3 Proofs. In: Proc. of FMCAD, pp. 19–27 (2011)Google Scholar