Tree Interpolation in Vampire
Paper i proceeding, 2013
We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.
theorem proving
program analysis
program verification
interpolation
formal methods
Författare
Regis Blanc
Ashutosh Gupta
Laura Kovacs
Chalmers, Data- och informationsteknik, Programvaruteknik
Bernhard Kragl
Proceedings of the 19th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-19), December 14-19, 2013, Stellenbosch, South Africa. Kenneth L. McMillan and Aart Middeldorp and Andrei Voronkov (editors), Springer Lecture Notes in Computer Science
Vol. LNCS 8312 173-181
Styrkeområden
Informations- och kommunikationsteknik
Ämneskategorier
Data- och informationsvetenskap
Programvaruteknik
Datavetenskap (datalogi)
DOI
10.1007/978-3-642-45221-5_13