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

page 1

page 2

page 3

page 4

research
01/11/2021

Register Automata with Extrema Constraints, and an Application to Two-Variable Logic

We introduce a model of register automata over infinite trees with extre...
research
02/10/2023

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures

We introduce the class of tree constraint automata with data values in Z...
research
04/26/2021

Improved Bounded Model Checking of Timed Automata

Timed Automata (TA) are a very popular modeling formalism for systems wi...
research
06/13/2022

Introducing Proof Tree Automata and Proof Tree Graphs

In structural proof theory, designing and working on large calculi make ...
research
05/21/2019

Automata Terms in a Lazy WSkS Decision Procedure (Technical Report)

We propose a lazy decision procedure for the logic WSkS. It builds a ter...
research
09/13/2016

Instrumenting an SMT Solver to Solve Hybrid Network Reachability Problems

PDDL+ planning has its semantics rooted in hybrid automata (HA) and rece...

Please sign up or login with your details

Forgot password? Click here to reset