A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C6810A8EAC2E90DCD0E694D1731BBEB4/S1471068418000157a.pdf/div-class-title-solving-horn-clauses-on-inductive-data-types-without-induction-div.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Solving Horn Clauses on Inductive Data Types Without Induction
<span title="">2018</span>
<i title="Cambridge University Press (CUP)">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhwvj6mbzza5tfz766tokherka" style="color: black;">Theory and Practice of Logic Programming</a>
</i>
Preserved Fulltext
Other Versions
<span title="2018-04-24">2018</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.09007v1">arXiv:1804.09007v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qhp3kn6mivbztgdoztsi5xskcy">fatcat:qhp3kn6mivbztgdoztsi5xskcy</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.09007v1">arXiv:1804.09007v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qhp3kn6mivbztgdoztsi5xskcy">fatcat:qhp3kn6mivbztgdoztsi5xskcy</a> </span>
AbstractWe address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs) based on theories of inductively defined data structures, such as lists and trees. We propose a transformation technique whose objective is the removal of these data structures from CHCs, hence reducing their satisfiability to a satisfiability problem for CHCs on integers and booleans. We propose a transformation algorithm and identify a class of clauses where it always succeeds. We also consider
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068418000157">doi:10.1017/s1471068418000157</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ovs527z7qjd45odoz2psaybax4">fatcat:ovs527z7qjd45odoz2psaybax4</a>
</span>
more »
... extension of that algorithm, which combines clause transformation with reasoning on integer constraints. Via an experimental evaluation we show that our technique greatly improves the effectiveness of applying the Z3 solver to CHCs. We also show that our verification technique based on CHC transformation followed by CHC solving, is competitive with respect to CHC solvers extended with induction.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502104557/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C6810A8EAC2E90DCD0E694D1731BBEB4/S1471068418000157a.pdf/div-class-title-solving-horn-clauses-on-inductive-data-types-without-induction-div.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/a6/4f/a64fd6c9fef88d64bba2662e5c00020cec6916fa.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1471068418000157">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
cambridge.org
</button>
</a>