Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. - Jürgen Giesl; Stephan Swiderski; Peter Schneider-Kamp; René Thiemann (RTA, 2006)

Proving Termination by Bounded Increase. - Jürgen Giesl; René Thiemann; Stephan Swiderski; Peter Schneider-Kamp (CADE, 2007)

Termination of Programs using Term Rewriting and SAT Solving. - Jürgen Giesl; Peter Schneider-Kamp; René Thiemann; Stephan Swiderski; Manh Thang Nguyen; Danny De Schreye; Alexander Serebrenik (Deduction and Decision Procedures, 2007)

Termination Analysis by Dependency Pairs and Inductive Theorem Proving. - Stephan Swiderski; Michael Parting; Jürgen Giesl; Carsten Fuhs; Peter Schneider-Kamp (CADE, 2009)

Inductive Theorem Proving meets Dependency Pairs. - Stephan Swiderski; Michael Parting; Jürgen Giesl; Carsten Fuhs; Peter Schneider-Kamp (Interaction versus Automation: The two Faces of Deduction, 2009)

Proving Termination by Dependency Pairs and Inductive Theorem Proving. - Carsten Fuhs; Jürgen Giesl; Michael Parting; Peter Schneider-Kamp; Stephan Swiderski (J. Autom. Reason., 2011)

Automated termination proofs for haskell by term rewriting. - Jürgen Giesl; Matthias Raffelsieper; Peter Schneider-Kamp; Stephan Swiderski; René Thiemann (ACM Trans. Program. Lang. Syst., 2011)