Year: 2025
Type: article
Abstract: This paper is an extended version of our earlier work [1], which introduced Theta as a Horn clause solver and described its participation in CHC-COMP. While the original publication focused on the competition context, this extended version provides a more comprehensive and self-contained treatment of Theta's CHC-solving capabilities, with a focus on longer-term applicability rather than competition-specific results. Theta is a verification framework whose core approach is based on transforming constrained Horn clauses (CHCs) into control-flow automata (CFAs) for analysis. We provide a detailed description of the algorithms employed by Theta, including our model generation techniques, highlighting the unique features that distinguish it from other CHC solvers. We present a thorough experimental evaluation: first analyzing individual verification configurations, then assembling and evaluating portfolios, and finally assessing model generation capabilities. We also present results on floating-point arithmetic, a category where Theta is, to our knowledge, the only CHC solver capable of producing results.
DOI: 10.4204/eptcs.434.5
Authors: Levente Bajczi, Milán Mondok, Vince Molnár
Institution: Budapest University of Technology and Economics
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Awards: G1688296686, G6991884211
OpenAlex ID: W4415659391
FWCI:
Cites:
Cited by:
Related to: