The dependency pair technique is a powerful method for automated termination and
innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates …

The appropriate selection of the arguments of functions that can be evaluated in function
calls is often useful to improve efficiency, speed, termination behavior, and so on. This is …

The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving
termination of rewrite systems. It incorporates several new refinements of the dependency …

We present a novel way for reasoning about (possibly ir) rational quantifier-free non-linear
arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated to …

We study the termination problem for probabilistic term rewrite systems. We prove that the
interpretation method is sound and complete for a strengthening of positive almost sure …

Polynomial constraint solving plays a prominent role in several areas of hardware and
software analysis and verification, eg, termination proving, program invariant generation and …

Term rewriting systems play an important role in many areas of computer science. In
essence, they provide an abstract way to define algorithms. The theory is simple: terms …

By means of a simple reduction from Hilbert's 10th problem we prove the somewhat
surprising result that termination of one-rule rewrite systems by a linear interpretation in the …

We provide an overview of CPF, the certification problem format, and explain some design
decisions. Whereas CPF was originally invented to combine three different formats for …

Termination is the fundamental property of a program that for each input, the evaluation will
eventually stop and return some output. Although the question whether a given program …