Ultimate TreeAutomizer (CHC-COMP Tool Description)

@inproceedings{Dietsch2019UltimateT,
  title={Ultimate TreeAutomizer (CHC-COMP Tool Description)},
  author={Daniel Dietsch and Matthias Heizmann and Jochen Hoenicke and Alexander Nutz and Andreas Podelski},
  booktitle={HCVS/PERR@ETAPS},
  year={2019}
}
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. 
5 Citations
Competition Report: CHC-COMP-21
TLDR
The CHC-COMP-211 competition of solvers for Constrained Horn Clauses design, organisation, and results are presented.
Learning inductive invariants by sampling from frequency distributions
TLDR
A framework that follows the Syntax-Guided Synthesis paradigm to iteratively sample candidate invariants from a formal grammar and check them with an SMT solver, and is able to check several candidates at the same time to filter them effectively using the well known Houdini algorithm.
Unbounded Procedure Summaries from Bounded Environments
TLDR
This work proposes a novel modular verification algorithm that addresses challenges by learning lemmas about the relationships among procedure summaries and by using bounded environments in SMT queries.
Competition Report: CHC-COMP-20
TLDR
The CHC-COMP-201 competition of solvers for Constrained Horn Clauses was run in the first week of May 2020 using the StarExec computing cluster.
Competition Report: CHC-COMP-20
TLDR
The CHC-COMP-20 competition of solvers for Constrained Horn Clauses was run in the first week of May 2020 using the StarExec computing cluster and results are presented.

References

SHOWING 1-10 OF 20 REFERENCES
CVC: A Cooperating Validity Checker
TLDR
The CVC ("Cooperating Validity Checker") decision procedure is described, which implements a framework for combining subsidiary decision procedures for certain logical theories into a decision procedure for the theories' union.
Efficient implementation of property directed reachability
TLDR
A simplified and faster implementation of Aaron Bradley's bit-level symbolic model checking algorithm is presented, and successful and unsuccessful attempts to improve it are discussed.
Horn Clause Solvers for Program Verification
TLDR
The authors summarize main useful properties of Horn clauses, illustrate encodings of procedural program verification into Horn clauses and then highlight a number of useful simplification strategies at the level of Horn clause.
Nested interpolants
TLDR
The potential of the theory of nested words for partial correctness proofs of recursive programs and an interpolant-based software model checking method for recursive programs is explored.
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
TLDR
This paper builds a tool, called ARMC (for Abstraction Refinement Model Checking), which has already been used for practical verification and describes the outcome of the investigation.
Abstraction and Counterexample-Guided Construction of omega -Automata for Model Checking of Step-Discrete Linear Hybrid Models
TLDR
The herein presented approach addresses step-discrete linear hybrid models with large discrete state spaces by introducing an iterative abstraction refinement approach based on learning reasons of spurious counterexamples in an ω-automaton.
Synthesizing software verifiers from proof rules
TLDR
This paper presents a method for the automatic synthesis of software verification tools and shows how it synthesizes automatic safety and liveness verifiers for programs with procedures, multi-threaded programs, and functional programs.
Thread modularity at many levels: a pearl in compositional verification
TLDR
A hierarchy of proof systems where each level k corresponds to a generalized notion of thread modularity (level 1 corresponds to the original notion) is described, which precisely captures programs that can be proved using uniform Ashcroft invariants with k universal quantifiers.
Craig vs. Newton in software model checking
TLDR
A total of 11 variants of Craig and Newton are implemented in two different state-of-the-art software model checking tools and the outcome of the experimental comparison is presented.
A Performance Study of BDD-Based Model Checking
TLDR
One of the main conclusions of this work is that the BDD computations in model checking and in building BDDs for the outputs of combinational circuits have fundamentally different performance characteristics.
...
1
2
...