• Publications
  • Influence
SAT Solving for Termination Analysis with Polynomial Interpretations
TLDR
We encode the search for polynomial interpretations as a SAT problem and apply modern SAT solvers to this task. Expand
  • 170
  • 12
  • PDF
Modular Complexity Analysis for Term Rewriting
TLDR
This article introduces a modular framework which allows to infer (polynomial) upper bounds on the complexity of term rewrite systems by combining different criteria. Expand
  • 20
  • 8
  • PDF
Tyrolean Termination Tool 2
This paper describes the second edition of the Tyrolean Termination Tool—a fully automatic termination analyzer for first-order term rewrite systems. The main features of this tool are itsExpand
  • 95
  • 7
  • PDF
CSI - A Confluence Tool
TLDR
This paper describes a new confluence tool for term rewrite systems. Expand
  • 38
  • 6
Satisfiability of Non-linear (Ir)rational Arithmetic
TLDR
We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. Expand
  • 65
  • 4
  • PDF
KBO Orientability
TLDR
This article presents three new approaches to prove termination of rewrite systems with the Knuth–Bendix order efficiently. Expand
  • 24
  • 3
  • PDF
Modular Complexity Analysis via Relative Complexity
TLDR
We introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining different criteria. Expand
  • 32
  • 2
  • PDF
Maximal Termination
TLDR
We present a new approach for termination proofs that uses polynomial interpretations (with possibly negative coefficients) together with the "maximum" function. Expand
  • 39
  • 2
  • PDF
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
TLDR
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. Expand
  • 23
  • 2
Uncurrying for Termination
TLDR
We present a transformation from untyped applicative term rewrite systems to functional term rewriting systems that preserves and reflects termination. Expand
  • 22
  • 2
  • PDF