A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
Classifying and Solving Horn Clauses for Verification
[chapter]
2014
Lecture Notes in Computer Science
As a promising direction to overcome difficulties of verification, researchers have recently proposed the use of Horn constraints as intermediate representation. Horn constraints are related to Craig interpolation, which is one of the main techniques used to construct and refine abstractions in verification, and to synthesise inductive loop invariants. We give a classification of the different forms of Craig interpolation problems found in literature, and show that all of them correspond to
doi:10.1007/978-3-642-54108-7_1
fatcat:4pj36cazfjhzjnphhw3ltrlb5y