Unsatisfiability Proofs for Horn Solving

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10507433" target="_blank" >RIV/00216208:11320/25:10507433 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/978-3-031-90653-4_4" target="_blank" >https://doi.org/10.1007/978-3-031-90653-4_4</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-031-90653-4_4" target="_blank" >10.1007/978-3-031-90653-4_4</a>

Result language

angličtina

Original language name

Unsatisfiability Proofs for Horn Solving

Original language description

Many verification tools currently rely on logic solvers as backend reasoning engines. Despite playing such a pivotal role, bugs are not uncommon in the complex codebases of these solvers. Validating their results is thus critical, with correctness witnesses often being used for this end. Output validation for constrained Horn clauses (CHC) solvers is not a well explored topic though, especially in regards to unsatisfiability results. This is a significant issue, given that CHC solvers are being increasingly employed in verification tooling. To address it, we propose an approach to validate CHC unsatisfiability results based on independently checkable proofs. Our approach is generic in regards to the solving algorithm, preprocessing steps, and exact proof format used, and works by first producing a coarse-grained proof during solving and then instantiating it into a suitable proof format by adding missing details, at which point the instantiated proof can be checked by an independent proof checker. We instrumented a state-of-the-art CHC solver to generate proofs in the Alethe format and performed a large-scale evaluation. Our results indicate that proofs can be produced with minimal overhead, can be efficiently checked, and have tractable sizes.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA23-06506S" target="_blank" >GA23-06506S: Advanced Analysis and Verification for Advanced Software</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Tools and Algorithms for the Construction and Analysis of Systems

ISBN

978-3-031-90652-7

ISSN

—

e-ISSN

—

Number of pages

21

Pages from-to

67-87

Publisher name

Springer

Place of publication

Cham

Event location

Hamilton, Canada

Event date

May 3, 2025

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—