The following publications are possibly variants of this publication:
- Modular Termination Proofs of Recursive Java Bytecode Programs by Term RewritingMarc Brockschmidt, Carsten Otto, Jürgen Giesl. RTA 2011: 155-170 [doi]
- Automated Termination Analysis for Logic Programs by Term RewritingPeter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. LOPSTR 2007: 177-193 [doi]
- Termination Graphs for Java BytecodeMarc Brockschmidt, Carsten Otto, Christian von Essen, Jürgen Giesl. BIRTHDAY 2010: 17-37 [doi]
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming LanguagesJürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann. RTA 2006: 297-312 [doi]
- Automated termination proofs for haskell by term rewritingJürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann. TOPLAS, 33(2):7, 2011. [doi]
- Automated termination proofs for logic programs by term rewritingPeter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann. tocl, 11(1), 2009. [doi]