A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
McMillan & An drey Rybalchenko (2015): Horn Clause Solvers for Program V erification
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
Ultimate TreeAutomizer is a CHC solver based on trace abstraction, tree automata and tree interpolation, presented as a tool description for the CHC-COMP 2019 competition.
citing papers explorer
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
-
Ultimate TreeAutomizer (CHC-COMP Tool Description)
Ultimate TreeAutomizer is a CHC solver based on trace abstraction, tree automata and tree interpolation, presented as a tool description for the CHC-COMP 2019 competition.