Golem: a flexibile and efficient solver for constrained Horn clauses

Abstract:

The logical framework of Constrained Horn Clauses (CHC) models verification tasks from a variety of domains, ranging from verification of safety properties in transition systems to modular verification of programs with procedures. In this work we present Golem, a flexible and efficient solver for satisfiability of CHCs over linear real and integer arithmetic. Golem provides flexibility with modular architecture and multiple back-end model-checking algorithms, as well as efficiency with tight integration with the underlying SMT solver. This paper describes the architecture of Golem and its back-end engines, which include our recently introduced model-checking algorithm TPA for deep exploration. The description is complemented by extensive evaluation, demonstrating the competitive nature of the solver.

BibTeX:

@article{blicha_golem_2025,
    title = {{Golem: a flexibile and efficient solver for constrained Horn clauses}},
    author = {Blicha, Martin and Britikov, Konstantin and Sharygina, Natasha},
    year = {2025},
    journal = {{Formal Methods in System Design}},
    doi = {10.1007/s10703-025-00470-9},
    issn = {1572-8102},
    url = {https://doi.org/10.1007/s10703-025-00470-9},
    shorttitle = {Golem},
}

Journal article