The following publications are possibly variants of this publication:
- Proving Termination by Dependency Pairs and Inductive Theorem ProvingCarsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski. JAR, 47(2):133-160, 2011. [doi]
- Automatic Termination Proofs in the Dependency Pair FrameworkJürgen Giesl, Peter Schneider-Kamp, René Thiemann. cade 2006: 281-286 [doi]
- The Dependency Pair Framework: Combining Techniques for Automated Termination ProofsJürgen Giesl, René Thiemann, Peter Schneider-Kamp. lpar 2005: 301-331 [doi]
- Proving and Disproving Termination of Higher-Order FunctionsJürgen Giesl, René Thiemann, Peter Schneider-Kamp. frocos 2005: 216-231 [doi]
- Termination Analysis by Dependency Pairs and Inductive Theorem ProvingStephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp. cade 2009: 322-338 [doi]
- Modularity of Termination Using Dependency pairsThomas Arts, Jürgen Giesl. RTA 1998: 226-240 [doi]