| * | 2009 |
|---|
| 4 | EE | 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 |
|---|
| 3 | EE | Jürgen Giesl,
René Thiemann,
Stephan Swiderski,
Peter Schneider-Kamp:
Proving Termination by Bounded Increase.
CADE 2007: 443-459 |
| 2 | EE | 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 |
|---|
| 1 | EE | 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 |
