default search action
Harald Zankl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c27]Takahito Aoto, Makoto Hamana, Nao Hirokawa
, Aart Middeldorp
Confluence Competition 2018. FSCD 2018: 32:1-32:5 - 2017
- [j9]Julian Nagele
Certifying Confluence Proofs via Relative Termination and Rule Labeling. Log. Methods Comput. Sci. 13(2) (2017) - 2016
- [i9]Julian Nagele
Certifying Confluence Proofs via Relative Termination and Rule Labeling. CoRR abs/1612.07195 (2016) - 2015
- [j8]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
Labelings for Decreasing Diagrams. J. Autom. Reason. 54(2): 101-133 (2015) - [j7]Harald Zankl, Sarah Winkler
Beyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations. J. Symb. Comput. 69: 129-158 (2015) - [j6]Bertram Felgenhauer, Aart Middeldorp
Layer Systems for Proving Confluence. ACM Trans. Comput. Log. 16(2): 14:1-14:32 (2015) - [c26]Takahito Aoto, Nao Hirokawa
Confluence Competition 2015. CADE 2015: 101-104 - [c25]Thomas Sternagel
Recording Completion for Certificates in Equational Reasoning. CPP 2015: 41-47 - [c24]Julian Nagele
Certified Rule Labeling. RTA 2015: 269-284 - 2014
- [j5]Harald Zankl, Martin Korp:
Modular Complexity Analysis for Term Rewriting. Log. Methods Comput. Sci. 10(1) (2014) - [i8]Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. CoRR abs/1404.1225 (2014) - [i7]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp:
Labelings for Decreasing Diagrams. CoRR abs/1406.3139 (2014) - 2013
- [j4]Harald Zankl:
Decreasing Diagrams. Arch. Formal Proofs 2013 (2013) - [j3]Nao Hirokawa
Uncurrying for Termination and Complexity. J. Autom. Reason. 50(3): 279-315 (2013) - [c23]Sarah Winkler, Harald Zankl, Aart Middeldorp
Beyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence. RTA 2013: 335-351 - [c22]Harald Zankl:
Confluence by Decreasing Diagrams - Formalized. RTA 2013: 352-367 - 2012
- [c21]Thomas Sternagel
KBCV - Knuth-Bendix Completion Visualizer. IJCAR 2012: 530-536 - [c20]Sarah Winkler
Ordinals and Knuth-Bendix Orders. LPAR 2012: 420-434 - [i6]Christian Sternagel, René Thiemann, Sarah Winkler, Harald Zankl:
CeTA - A Tool for Certified Termination Analysis. CoRR abs/1208.1591 (2012) - [i5]Thomas Sternagel, René Thiemann, Harald Zankl, Christian Sternagel:
Recording Completion for Finding and Certifying Proofs in Equational Logic. CoRR abs/1208.1597 (2012) - [i4]Harald Zankl:
Confluence by Decreasing Diagrams -- Formalized. CoRR abs/1210.1100 (2012) - 2011
- [c19]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
CSI - A Confluence Tool. CADE 2011: 499-505 - [c18]Aart Middeldorp
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI 2011: 1-20 - [c17]Bertram Felgenhauer, Harald Zankl, Aart Middeldorp
Layer Systems for Proving Confluence. FSTTCS 2011: 288-299 - [c16]Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
Labelings for Decreasing Diagrams. RTA 2011: 377-392 - 2010
- [c15]Friedrich Neurauter, Aart Middeldorp
Monotonicity Criteria for Polynomial Interpretations over the Naturals. IJCAR 2010: 502-517 - [c14]Harald Zankl, Martin Korp:
On Implementing Modular Complexity Analysis. IWIL@LPAR 2010: 42-47 - [c13]Harald Zankl, Aart Middeldorp
Satisfiability of Non-linear (Ir)rational Arithmetic. LPAR (Dakar) 2010: 481-500 - [c12]Friedrich Neurauter, Harald Zankl, Aart Middeldorp
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. LPAR (Yogyakarta) 2010: 550-564 - [c11]Harald Zankl, Martin Korp:
Modular Complexity Analysis via Relative Complexity. RTA 2010: 385-400 - [c10]Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp
Finding and Certifying Loops. SOFSEM 2010: 755-766 - [c9]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
Uncurrying for Innermost Termination and Derivational Complexity. HOR 2010: 46-57
2000 – 2009
- 2009
- [j2]Harald Zankl, Aart Middeldorp
Increasing interpretations. Ann. Math. Artif. Intell. 56(1): 87-108 (2009) - [j1]Harald Zankl, Nao Hirokawa
KBO Orientability. J. Autom. Reason. 43(2): 173-201 (2009) - [c8]Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp
Tyrolean Termination Tool 2. RTA 2009: 295-304 - 2008
- [c7]Harald Zankl, Aart Middeldorp
Increasing Interpretations. AISC/MKM/Calculemus 2008: 191-205 - [c6]Nao Hirokawa
Uncurrying for Termination. LPAR 2008: 667-681 - [c5]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp
Maximal Termination. RTA 2008: 110-125 - [c4]Harald Zankl, Christian Sternagel, Aart Middeldorp
Transforming SAT into Termination of Rewriting. WFLP 2008: 199-214 - 2007
- [c3]Harald Zankl, Aart Middeldorp:
Satisfying KBO Constraints. RTA 2007: 389-403 - [c2]Carsten Fuhs, Jürgen Giesl
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354 - [c1]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
Constraints for Argument Filterings. SOFSEM (1) 2007: 579-590 - [i3]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 - 2006
- [i2]Harald Zankl:
SAT Techniques for Lexicographic Path Orders. CoRR abs/cs/0605021 (2006) - [i1]Harald Zankl, Aart Middeldorp:
Satisfying KBO Constraints. CoRR abs/cs/0608032 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: