Harald Zankl

Publication Activity (10 Years)

Years Active: 2006-2018
Publications (10 Years): 3

Top Topics

Rewrite Systems

Theorem Proving

Termination Analysis

Top Venues

Log. Methods Comput. Sci.

J. Autom. Reason.

Publications

Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl
Confluence Competition 2018. FSCD (2018)
Julian Nagele, Bertram Felgenhauer, Harald Zankl
Certifying Confluence Proofs via Relative Termination and Rule Labeling. Log. Methods Comput. Sci. 13 (2) (2017)
Julian Nagele, Bertram Felgenhauer, Harald Zankl
Certifying Confluence Proofs via Relative Termination and Rule Labeling. CoRR (2016)
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
Labelings for Decreasing Diagrams. J. Autom. Reason. 54 (2) (2015)
Harald Zankl, Sarah Winkler, Aart Middeldorp
Beyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations. J. Symb. Comput. 69 (2015)
Thomas Sternagel, Sarah Winkler, Harald Zankl
Recording Completion for Certificates in Equational Reasoning. CPP (2015)
Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, Harald Zankl
Confluence Competition 2015. CADE (2015)
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. ACM Trans. Comput. Log. 16 (2) (2015)
Julian Nagele, Harald Zankl
Certified Rule Labeling. RTA (2015)
Harald Zankl, Martin Korp
Modular Complexity Analysis for Term Rewriting. Log. Methods Comput. Sci. 10 (1) (2014)
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. CoRR (2014)
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
Labelings for Decreasing Diagrams. CoRR (2014)
Nao Hirokawa, Aart Middeldorp, Harald Zankl
Uncurrying for Termination and Complexity. J. Autom. Reason. 50 (3) (2013)
Sarah Winkler, Harald Zankl, Aart Middeldorp
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence. RTA (2013)
Harald Zankl
Decreasing Diagrams. Arch. Formal Proofs 2013 (2013)
Harald Zankl
Confluence by Decreasing Diagrams - Formalized. RTA (2013)
Sarah Winkler, Harald Zankl, Aart Middeldorp
Ordinals and Knuth-Bendix Orders. LPAR (2012)
Christian Sternagel, René Thiemann, Sarah Winkler, Harald Zankl
CeTA - A Tool for Certified Termination Analysis CoRR (2012)
Harald Zankl
Confluence by Decreasing Diagrams -- Formalized CoRR (2012)
Thomas Sternagel, Harald Zankl
KBCV - Knuth-Bendix Completion Visualizer. IJCAR (2012)
Thomas Sternagel, René Thiemann, Harald Zankl, Christian Sternagel
Recording Completion for Finding and Certifying Proofs in Equational Logic CoRR (2012)
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
CSI - A Confluence Tool. CADE (2011)
Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI (2011)
Bertram Felgenhauer, Harald Zankl, Aart Middeldorp
Layer Systems for Proving Confluence. FSTTCS (2011)
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
Labelings for Decreasing Diagrams. RTA (2011)
Friedrich Neurauter, Aart Middeldorp, Harald Zankl
Monotonicity Criteria for Polynomial Interpretations over the Naturals. IJCAR (2010)
Friedrich Neurauter, Harald Zankl, Aart Middeldorp
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. LPAR (Yogyakarta) (2010)
Harald Zankl, Martin Korp
On Implementing Modular Complexity Analysis. IWIL@LPAR (2010)
Harald Zankl, Martin Korp
Modular Complexity Analysis via Relative Complexity. RTA (2010)
Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp
Finding and Certifying Loops. SOFSEM (2010)
Harald Zankl, Aart Middeldorp
Satisfiability of Non-linear (Ir)rational Arithmetic. LPAR (Dakar) (2010)
Harald Zankl, Nao Hirokawa, Aart Middeldorp
Uncurrying for Innermost Termination and Derivational Complexity HOR (2010)
Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp
Tyrolean Termination Tool 2. RTA (2009)
Harald Zankl, Nao Hirokawa, Aart Middeldorp
KBO Orientability. J. Autom. Reason. 43 (2) (2009)
Harald Zankl, Christian Sternagel, Aart Middeldorp
Transforming SAT into Termination of Rewriting. Electron. Notes Theor. Comput. Sci. 246 (2009)
Harald Zankl, Aart Middeldorp
Increasing interpretations. Ann. Math. Artif. Intell. 56 (1) (2009)
Harald Zankl, Aart Middeldorp
Increasing Interpretations. AISC/MKM/Calculemus (2008)
Nao Hirokawa, Aart Middeldorp, Harald Zankl
Uncurrying for Termination. LPAR (2008)
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
Maximal Termination. RTA (2008)
Harald Zankl, Nao Hirokawa, Aart Middeldorp
Constraints for Argument Filterings. SOFSEM (1) (2007)
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)
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT (2007)
Harald Zankl, Aart Middeldorp
Satisfying KBO Constraints. RTA (2007)
Harald Zankl, Aart Middeldorp
Satisfying KBO Constraints CoRR (2006)
Harald Zankl
SAT Techniques for Lexicographic Path Orders CoRR (2006)