Automating the dependency pair method

Termination of term rewriting using dependency pairs

Thomas Arts, Jürgen Giesl · Theoretical Computer Science · 2000 · 498 citations

Language Studies, Linguistics, Formal Methods +4

Term rewriting and all that

Computers & Mathematics with Applications · 1998 · 253 citations

Computing, Mathematics, Syntax +4

Counterexamples to termination for the direct sum of term rewriting systems

Yoshihito Toyama · Information Processing Letters · 1987 · 170 citations

Computing, Computer Science, Formal Methods +5

Context-Sensitive Rewriting Strategies

Simon M. Lucas · Information and Computation · 2002 · 82 citations

Modular Termination Proofs for Rewriting Using Dependency Pairs

Jürgen Giesl, Thomas Arts, Enno Ohlebusch · Journal of Symbolic Computation · 2002 · 75 citations

Computing, Computer Science, Formal Methods +8