The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

@inproceedings{Giesl2004TheDP,
  title={The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs},
  author={J{\"u}rgen Giesl and Ren{\'e} Thiemann and Peter Schneider-Kamp},
  booktitle={LPAR},
  year={2004}
}
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 prove termination. In this paper, we show that dependency pairs can instead be used as a general concept to integrate arbitrary techniques for termination analysis. In this way, the benefits of different techniques can be combined and their modularity and power are increased significantly. We refer to this… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
107 Citations
22 References
Similar Papers

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…