Ultimate TreeAutomizer (CHC-COMP Tool Description)

07/09/2019
by   Daniel Dietsch, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset