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 <a rel="external noopener" href="http://lara.epfl.ch:80/~kuncak/papers/RuemmerETAL13ClassifyingSolvingHornClausesVerification.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Classifying and Solving Horn Clauses for Verification
[chapter]
<span title="">2014</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
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
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-54108-7_1">doi:10.1007/978-3-642-54108-7_1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4pj36cazfjhzjnphhw3ltrlb5y">fatcat:4pj36cazfjhzjnphhw3ltrlb5y</a>
</span>
more »
... ral fragments of (recursion-free) Horn constraints. For a logic that has the binary interpolation property, all of these problems are solvable, but have different complexity. In addition to presenting the theoretical classification and solvability results, we present a publicly available collection of benchmarks to evaluate solvers for Horn constraints, categorized according to our classification. The benchmarks are derived from real-world verification problems. The behavior with our tools as well as with Z3 prover indicates the importance of Horn clause solving as distinct from the general problem of solving quantified constraints by quantifier instantiation.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151123124957/http://lara.epfl.ch:80/~kuncak/papers/RuemmerETAL13ClassifyingSolvingHornClausesVerification.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/3f/fc/3ffc7d5fbe22d8b61ea87f7ad503c1933aa225bb.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-54108-7_1">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>