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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CHCVerif: A Portfolio-Based Solver for Constrained Horn Clauses

Levente Bajczi, András Vörös, Mihály Dobos-Kovács
Electronic Proceedings in Theoretical Computer Science
Formal Methods in Verification
article

CHCVerif: A Portfolio-Based Solver for Constrained Horn Clauses

Levente Bajczi, András Vörös, Mihály Dobos-Kovács
article en

Abstract

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.

Electronic Proceedings in Theoretical Computer ScienceVol. 434
Budapest University of Technology and Economics (HU)
Nemzeti Kutatási, Fejlesztési és Innovaciós Alap, National Research, Development and Innovation Office
Openalex Percentile: Top 67%
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

CHCVerif: A Portfolio-Based Solver for Constrained Horn Clauses — Levente Bajczi, András Vörös, et al. · Electronic Proceedings in Theoretical Computer Science (2025) | TGRS Research Map | TGRS