Termination of term rewriting using dependency pairs

Abstract

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 of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique… (More)
DOI: 10.1016/S0304-3975(99)00207-8

Topics

  • Presentations referencing similar topics