Abstract | ||
---|---|---|
We present Ultimate TreeAutomizer, a solver for satisfiability of sets of constrained Horn clauses. Constrained Horn clauses (CHC) are a fragment of first order logic with attractive properties in terms of expressiveness and accessibility to algorithmic solving. Ultimate TreeAutomizer is based on the techniques of trace abstraction, tree automata and tree interpolation. This paper serves as a tool description for TreeAutomizer in CHC-COMP 2019. |
Year | DOI | Venue |
---|---|---|
2019 | 10.4204/EPTCS.296.7 | European Joint Conferences on Theory And Practice of Software |
DocType | ISSN | Citations |
Conference | EPTCS 296, 2019, pp. 42-47 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Daniel Dietsch | 1 | 80 | 13.53 |
Matthias Heizmann | 2 | 193 | 18.14 |
Jochen Hoenicke | 3 | 292 | 20.43 |
Alexander Nutz | 4 | 69 | 8.58 |
Andreas Podelski | 5 | 2760 | 197.87 |