• Publications
  • Influence
Termination of term rewriting using dependency pairs
  • T. Arts, J. Giesl
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 6 April 2000
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left- and right-hand sides ofExpand
  • 548
  • 75
  • Open Access
Automatic Termination Proofs in the Dependency Pair Framework
AProVE 1.2 is one of the most powerful systems for automated termination proofs of term rewrite systems (TRSs). It is the first tool which automates the new dependency pair framework [8] andExpand
  • 270
  • 34
  • Open Access
Mechanizing and Improving Dependency Pairs
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 inequality constraints thatExpand
  • 184
  • 21
  • Open Access
Automated Termination Proofs with AProVE
We describe the system ProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient algorithms based onExpand
  • 159
  • 18
  • Open Access
SAT Solving for Termination Analysis with Polynomial Interpretations
Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most termination provers. We showExpand
  • 168
  • 12
  • Open Access
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible methods to proveExpand
  • 146
  • 11
  • Open Access
Alternating Runtime and Size Complexity Analysis of Integer Programs
We present a modular approach to automatic complexity analysis. Based on a novel alternation between finding symbolic time bounds for program parts and using these to infer size bounds on programExpand
  • 70
  • 10
  • Open Access
Proving and Disproving Termination of Higher-Order Functions
The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems (TRSs). We present two important extensions of this technique: First, we show howExpand
  • 159
  • 8
  • Open Access
Analyzing Program Termination and Complexity Automatically with AProVE
In this system description, we present the tool AProVE for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and rewrite systems. In addition to classical term rewrite systemsExpand
  • 75
  • 7
  • Open Access
Analyzing Runtime and Size Complexity of Integer Programs
We present a modular approach to automatic complexity analysis of integer programs. Based on a novel alternation between finding symbolic time bounds for program parts and using these to infer boundsExpand
  • 44
  • 7
  • Open Access