CHCVerif: A Portfolio-Based Solver for Constrained Horn Clauses
Constrained Horn Clauses (CHCs) are widely adopted as intermediate representations for a variety of verification tasks, including safety checking, invariant synthesis, and interprocedural analysis.This paper introduces CHCVERIF, a portfolio-based CHC solver that adopts a software verification approach for solving CHCs.This approach enables us to reuse mature software verification tools to tackle CHC benchmarks, particularly those involving bitvectors and low-level semantics.Our evaluation shows that while the method enjoys only moderate success with linear integer arithmetic, it achieves modest success on bitvector benchmarks.Moreover, our results demonstrate the viability and potential of using software verification tools as backends for CHC solving, particularly when supported by a carefully constructed portfolio.
Authors
- Levente Bajczi (ORCID: https://orcid.org/0000-0002-6551-5860)
- András Vörös (ORCID: https://orcid.org/0000-0001-7617-3563)
- Mihály Dobos-Kovács (ORCID: https://orcid.org/0000-0002-0064-2965)
Institutions
- Budapest University of Technology and Economics (HU)
Publication Details
- Journal
- Electronic Proceedings in Theoretical Computer Science
- Published
- 2025-10-29
- DOI
- https://doi.org/10.4204/eptcs.434.6
- Primary Topic
- Formal Methods in Verification
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
- National Research, Development and Innovation Office