- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j2 |      | Carsten Fuhs, Jürgen Giesl, Michael Parting, Peter Schneider-Kamp, Stephan Swiderski: Proving Termination by Dependency Pairs and Inductive Theorem Proving. J. Autom. Reasoning 47(2): 133-160 (2011) |
| j1 | | Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann: Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7 (2011) |
| 2009 | ||
| c4 | | Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp: Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338 |
| 2007 | ||
| c3 | | Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp: Proving Termination by Bounded Increase. CADE 2007: 443-459 |
| c2 | | Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik: Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures 2007 |
| 2006 | ||
| c1 | | Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. RTA 2006: 297-312 |
| 1 | Carsten Fuhs | |
| 2 | Jürgen Giesl | |
| 3 | Manh Thang Nguyen | |
| 4 | Michael Parting | |
| 5 | Matthias Raffelsieper | |
| 6 | Peter Schneider-Kamp | |
| 7 | Danny De Schreye | |
| 8 | Alexander Serebrenik | |
| 9 | René Thiemann |
Data released under the ODC-BY 1.0 license — See also our legal information page