2009 |
27 | EE | René Thiemann:
From Outermost Termination to Innermost Termination.
SOFSEM 2009: 533-545 |
2008 |
26 | EE | Beatriz Alarcón,
Fabian Emmes,
Carsten Fuhs,
Jürgen Giesl,
Raúl Gutiérrez,
Salvador Lucas,
Peter Schneider-Kamp,
René Thiemann:
Improving Context-Sensitive Dependency Pairs.
LPAR 2008: 636-651 |
25 | EE | Carsten Fuhs,
Jürgen Giesl,
Aart Middeldorp,
Peter Schneider-Kamp,
René Thiemann,
Harald Zankl:
Maximal Termination.
RTA 2008: 110-125 |
24 | EE | René Thiemann,
Jürgen Giesl,
Peter Schneider-Kamp:
Deciding Innermost Loops.
RTA 2008: 366-380 |
23 | EE | René Thiemann,
Hans Zantema,
Jürgen Giesl,
Peter Schneider-Kamp:
Adding constants to string rewriting.
Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008) |
22 | EE | Peter Schneider-Kamp,
Jürgen Giesl,
Alexander Serebrenik,
René Thiemann:
Automated Termination Proofs for Logic Programs by Term Rewriting
CoRR abs/0803.0014: (2008) |
21 | EE | René Thiemann,
Aart Middeldorp:
Innermost Termination of Rewrite Systems by Labeling.
Electr. Notes Theor. Comput. Sci. 204: 3-19 (2008) |
2007 |
20 | EE | Jürgen Giesl,
René Thiemann,
Stephan Swiderski,
Peter Schneider-Kamp:
Proving Termination by Bounded Increase.
CADE 2007: 443-459 |
19 | EE | René Thiemann,
Jürgen Giesl,
Peter Schneider-Kamp:
Decision Procedures for Loop Detection.
Deduction and Decision Procedures 2007 |
18 | EE | Peter Schneider-Kamp,
Carsten Fuhs,
René Thiemann,
Jürgen Giesl,
Elena Annov,
Michael Codish,
Aart Middeldorp,
Harald Zankl:
Implementing RPO and POLO using SAT.
Deduction and Decision Procedures 2007 |
17 | 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 |
16 | EE | Peter Schneider-Kamp,
René Thiemann,
Elena Annov,
Michael Codish,
Jürgen Giesl:
Proving Termination Using Recursive Path Orders and SAT Solving.
FroCos 2007: 267-282 |
15 | EE | Carsten Fuhs,
Jürgen Giesl,
Aart Middeldorp,
Peter Schneider-Kamp,
René Thiemann,
Harald Zankl:
SAT Solving for Termination Analysis with Polynomial Interpretations.
SAT 2007: 340-354 |
2006 |
14 | EE | Jürgen Giesl,
Peter Schneider-Kamp,
René Thiemann:
Automatic Termination Proofs in the Dependency Pair Framework.
IJCAR 2006: 281-286 |
13 | EE | Peter Schneider-Kamp,
Jürgen Giesl,
Alexander Serebrenik,
René Thiemann:
Automated Termination Analysis for Logic Programs by Term Rewriting.
LOPSTR 2006: 177-193 |
12 | EE | Michael Codish,
Peter Schneider-Kamp,
Vitaly Lagoon,
René Thiemann,
Jürgen Giesl:
SAT Solving for Argument Filterings.
LPAR 2006: 30-44 |
11 | 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 |
10 | EE | Michael Codish,
Peter Schneider-Kamp,
Vitaly Lagoon,
René Thiemann,
Jürgen Giesl:
SAT Solving for Argument Filterings
CoRR abs/cs/0605074: (2006) |
9 | EE | Jürgen Giesl,
René Thiemann,
Peter Schneider-Kamp,
Stephan Falke:
Mechanizing and Improving Dependency Pairs.
J. Autom. Reasoning 37(3): 155-203 (2006) |
2005 |
8 | EE | Jürgen Giesl,
René Thiemann,
Peter Schneider-Kamp:
Proving and Disproving Termination in the Dependency Pair Framework.
Deduction and Applications 2005 |
7 | EE | Jürgen Giesl,
René Thiemann,
Peter Schneider-Kamp:
Proving and Disproving Termination of Higher-Order Functions.
FroCos 2005: 216-231 |
6 | EE | René Thiemann,
Jürgen Giesl:
The size-change principle and dependency pairs for termination of term rewriting.
Appl. Algebra Eng. Commun. Comput. 16(4): 229-270 (2005) |
2004 |
5 | EE | René Thiemann,
Jürgen Giesl,
Peter Schneider-Kamp:
Improved Modular Termination Proofs Using Dependency Pairs.
IJCAR 2004: 75-90 |
4 | EE | Jürgen Giesl,
René Thiemann,
Peter Schneider-Kamp:
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.
LPAR 2004: 301-331 |
3 | EE | Jürgen Giesl,
René Thiemann,
Peter Schneider-Kamp,
Stephan Falke:
Automated Termination Proofs with AProVE.
RTA 2004: 210-220 |
2003 |
2 | EE | Jürgen Giesl,
René Thiemann,
Peter Schneider-Kamp,
Stephan Falke:
Improving Dependency Pairs.
LPAR 2003: 167-182 |
1 | EE | René Thiemann,
Jürgen Giesl:
Size-Change Termination for Term Rewriting.
RTA 2003: 264-278 |