Harald Zankl

According to our database, Harald Zankl authored at least 38 papers between 2006 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

Confluence Competition 2018.

Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017

Certifying Confluence Proofs via Relative Termination and Rule Labeling.

Julian Nagele, Bertram Felgenhauer, Harald Zankl

Log. Methods Comput. Sci., 2017

2015

Layer Systems for Proving Confluence.

Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom

ACM Trans. Comput. Log., 2015

Beyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations.

Harald Zankl, Sarah Winkler, Aart Middeldorp

J. Symb. Comput., 2015

Labelings for Decreasing Diagrams.

Harald Zankl, Bertram Felgenhauer, Aart Middeldorp

J. Autom. Reason., 2015

Certified Rule Labeling.

Julian Nagele, Harald Zankl

Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Recording Completion for Certificates in Equational Reasoning.

Thomas Sternagel, Sarah Winkler, Harald Zankl

Proceedings of the 2015 Conference on Certified Programs and Proofs, 2015

Confluence Competition 2015.

Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, Harald Zankl

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Modular Complexity Analysis for Term Rewriting.

Harald Zankl, Martin Korp

Log. Methods Comput. Sci., 2014

2013

Uncurrying for Termination and Complexity.

Nao Hirokawa, Aart Middeldorp, Harald Zankl

J. Autom. Reason., 2013

Decreasing Diagrams.

Harald Zankl

Arch. Formal Proofs, 2013

Confluence by Decreasing Diagrams - Formalized.

Harald Zankl

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence.

Sarah Winkler, Harald Zankl, Aart Middeldorp

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012

Recording Completion for Finding and Certifying Proofs in Equational Logic

Thomas Sternagel, René Thiemann, Harald Zankl, Christian Sternagel

CoRR, 2012

CeTA - A Tool for Certified Termination Analysis

Christian Sternagel, René Thiemann, Sarah Winkler, Harald Zankl

CoRR, 2012

Ordinals and Knuth-Bendix Orders.

Sarah Winkler, Harald Zankl, Aart Middeldorp

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

KBCV - Knuth-Bendix Completion Visualizer.

Thomas Sternagel, Harald Zankl

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

Layer Systems for Proving Confluence.

Bertram Felgenhauer, Harald Zankl, Aart Middeldorp

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems.

Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

CSI - A Confluence Tool.

Harald Zankl, Bertram Felgenhauer, Aart Middeldorp

Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010

Uncurrying for Innermost Termination and Derivational Complexity

Harald Zankl, Nao Hirokawa, Aart Middeldorp

Proceedings of the Proceedings 5th International Workshop on Higher-Order Rewriting, 2010

Finding and Certifying Loops.

Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Modular Complexity Analysis via Relative Complexity.

Harald Zankl, Martin Korp

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Satisfiability of Non-linear (Ir)rational Arithmetic.

Harald Zankl, Aart Middeldorp

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

On Implementing Modular Complexity Analysis.

Harald Zankl, Martin Korp

Proceedings of the 8th International Workshop on the Implementation of Logics, 2010

Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting.

Friedrich Neurauter, Harald Zankl, Aart Middeldorp

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Monotonicity Criteria for Polynomial Interpretations over the Naturals.

Friedrich Neurauter, Aart Middeldorp, Harald Zankl

Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009

KBO Orientability.

Harald Zankl, Nao Hirokawa, Aart Middeldorp

J. Autom. Reason., 2009

Increasing interpretations.

Harald Zankl, Aart Middeldorp

Ann. Math. Artif. Intell., 2009

Tyrolean Termination Tool 2.

Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

Transforming SAT into Termination of Rewriting.

Harald Zankl, Christian Sternagel, Aart Middeldorp

Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming, 2008

Maximal Termination.

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Uncurrying for Termination.

Nao Hirokawa, Aart Middeldorp, Harald Zankl

Proceedings of the Logic for Programming, 2008

2007

Constraints for Argument Filterings.

Harald Zankl, Nao Hirokawa, Aart Middeldorp

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

SAT Solving for Termination Analysis with Polynomial Interpretations.

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Satisfying KBO Constraints.

Harald Zankl, Aart Middeldorp

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Implementing RPO and POLO using SAT.

Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

2006

SAT Techniques for Lexicographic Path Orders

Harald Zankl

CoRR, 2006