Harald Zankl - RankMe

45 papers A 5B 5Journal 17Unranked 18

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