 | 2011 |
| 23 |  | Harald Zankl,
Bertram Felgenhauer,
Aart Middeldorp:
CSI - A Confluence Tool.
CADE 2011: 499-505 |
| 22 |  | Aart Middeldorp,
Georg Moser,
Friedrich Neurauter,
Johannes Waldmann,
Harald Zankl:
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.
CAI 2011: 1-20 |
| 21 |  | Bertram Felgenhauer,
Harald Zankl,
Aart Middeldorp:
Layer Systems for Proving Confluence.
FSTTCS 2011: 288-299 |
| 20 |  | Harald Zankl,
Bertram Felgenhauer,
Aart Middeldorp:
Labelings for Decreasing Diagrams.
RTA 2011: 377-392 |
| 2010 |
| 19 |  | Harald Zankl,
Nao Hirokawa,
Aart Middeldorp:
Uncurrying for Innermost Termination and Derivational Complexity
HOR 2010: 46-57 |
| 18 |  | Friedrich Neurauter,
Aart Middeldorp,
Harald Zankl:
Monotonicity Criteria for Polynomial Interpretations over the Naturals.
IJCAR 2010: 502-517 |
| 17 |  | Harald Zankl,
Aart Middeldorp:
Satisfiability of Non-linear (Ir)rational Arithmetic.
LPAR (Dakar) 2010: 481-500 |
| 16 |  | Friedrich Neurauter,
Harald Zankl,
Aart Middeldorp:
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting.
LPAR (Yogyakarta) 2010: 550-564 |
| 15 |  | Harald Zankl,
Martin Korp:
Modular Complexity Analysis via Relative Complexity.
RTA 2010: 385-400 |
| 14 |  | Harald Zankl,
Christian Sternagel,
Dieter Hofbauer,
Aart Middeldorp:
Finding and Certifying Loops.
SOFSEM 2010: 755-766 |
| 2009 |
| 13 |  | Martin Korp,
Christian Sternagel,
Harald Zankl,
Aart Middeldorp:
Tyrolean Termination Tool 2.
RTA 2009: 295-304 |
| 12 |  | Harald Zankl,
Aart Middeldorp:
Increasing interpretations.
Ann. Math. Artif. Intell. 56(1): 87-108 (2009) |
| 11 |  | Harald Zankl,
Christian Sternagel,
Aart Middeldorp:
Transforming SAT into Termination of Rewriting.
Electr. Notes Theor. Comput. Sci. 246: 199-214 (2009) |
| 10 |  | Harald Zankl,
Nao Hirokawa,
Aart Middeldorp:
KBO Orientability.
J. Autom. Reasoning 43(2): 173-201 (2009) |
| 2008 |
| 9 |  | Harald Zankl,
Aart Middeldorp:
Increasing Interpretations.
AISC/MKM/Calculemus 2008: 191-205 |
| 8 |  | Nao Hirokawa,
Aart Middeldorp,
Harald Zankl:
Uncurrying for Termination.
LPAR 2008: 667-681 |
| 7 |  | Carsten Fuhs,
Jürgen Giesl,
Aart Middeldorp,
Peter Schneider-Kamp,
René Thiemann,
Harald Zankl:
Maximal Termination.
RTA 2008: 110-125 |
| 2007 |
| 6 |  | 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 |
| 5 |  | Harald Zankl,
Aart Middeldorp:
Satisfying KBO Constraints.
RTA 2007: 389-403 |
| 4 |  | 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 |
| 3 |  | Harald Zankl,
Nao Hirokawa,
Aart Middeldorp:
Constraints for Argument Filterings.
SOFSEM (1) 2007: 579-590 |
| 2006 |
| 2 |  | Harald Zankl:
SAT Techniques for Lexicographic Path Orders
CoRR abs/cs/0605021: (2006) |
| 1 |  | Harald Zankl,
Aart Middeldorp:
Satisfying KBO Constraints
CoRR abs/cs/0608032: (2006) |