CHCVerif: A Portfolio-Based Solver for Constrained Horn Clauses
By: Mihály Dobos-Kovács, Levente Bajczi, András Vörös
Potential Business Impact:
Helps computers check if programs are safe.
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.
Similar Papers
Theta as a Horn Solver
Logic in Computer Science
Checks computer programs for mistakes faster.
Sound and Complete Invariant-Based Heap Encodings (Technical Report)
Logic in Computer Science
Helps computers check programs with tricky memory.
Finding Regular Herbrand Models for CHCs using Answer Set Programming
Logic in Computer Science
Finds computer bugs by checking code rules.