Aart Middeldorp

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 39

Top Venues

Publications

Jonas Schöpf, Fabian Mitterwallner, Aart Middeldorp
Confluence of Logically Constrained Rewrite Systems Revisited. CoRR (2024)
Jonas Schöpf, Fabian Mitterwallner, Aart Middeldorp
Confluence of Logically Constrained Rewrite Systems Revisited. IJCAR (2) (2024)
Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp
Left-Linear Completion with AC Axioms. CoRR (2024)
Fabian Mitterwallner, Aart Middeldorp, René Thiemann
Linear Termination is Undecidable. LICS (2024)
René Thiemann, Fabian Mitterwallner, Aart Middeldorp
Undecidability Results on Orienting Single Rewrite Rules. Arch. Formal Proofs 2024 (2024)
Christina Kohl, Aart Middeldorp
Formalizing Almost Development Closed Critical Pairs (Short Paper). ITP (2023)
Aart Middeldorp, Alexander Lochmann, Fabian Mitterwallner
First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification. J. Autom. Reason. 67 (2) (2023)
Jonas Schöpf, Aart Middeldorp
Confluence Criteria for Logically Constrained Rewrite Systems (Full Version). CoRR (2023)
Jonas Schöpf, Aart Middeldorp
Confluence Criteria for Logically Constrained Rewrite Systems. CADE (2023)
Nao Hirokawa, Aart Middeldorp
Hydra Battles and AC Termination, Revisited. CoRR (2023)
Christina Kohl, Aart Middeldorp
A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems. CPP (2023)
Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp
Left-Linear Completion with AC Axioms. CADE (2023)
Nao Hirokawa, Aart Middeldorp
Hydra Battles and AC Termination. FSCD (2023)
Fabian Mitterwallner, Aart Middeldorp, René Thiemann
Linear Termination over N is Undecidable. CoRR (2023)
Fabian Mitterwallner, Aart Middeldorp
Polynomial Termination Over ℕ Is Undecidable. FSCD (2022)
Fabian Mitterwallner, Alexander Lochmann, Aart Middeldorp, Bertram Felgenhauer
Certifying Proofs in the First-Order Theory of Rewriting. TACAS (2) (2021)
Alexander Lochmann, Aart Middeldorp, Fabian Mitterwallner, Bertram Felgenhauer
A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems. CPP (2021)
Aart Middeldorp, Julian Nagele, Kiraku Shintani
CoCo 2019: report on the eighth confluence competition. Int. J. Softw. Tools Technol. Transf. 23 (6) (2021)
Alexander Lochmann, Aart Middeldorp
Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting. TACAS (2) (2020)
Bertram Felgenhauer, Aart Middeldorp, T. V. H. Prathamesh, Franziska Rapp
A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL. CPP (2019)
Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
Abstract Completion, Formalized. Log. Methods Comput. Sci. 15 (3) (2019)
Christina Kohl, Aart Middeldorp
Composing Proof Terms. CADE (2019)
Aart Middeldorp, Julian Nagele, Kiraku Shintani
Confluence Competition 2019. TACAS (3) (2019)
Sarah Winkler, Aart Middeldorp
Tools in Term Rewriting for Education. ThEdu@CADE (2019)
Nao Hirokawa, Julian Nagele, Aart Middeldorp
Cops and CoCoWeb: Infrastructure for Confluence Tools. IJCAR (2018)
Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl
Confluence Competition 2018. FSCD (2018)
Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
Abstract Completion, Formalized. CoRR (2018)
Sarah Winkler, Aart Middeldorp
Completion for Logically Constrained Rewriting. FSCD (2018)
Franziska Rapp, Aart Middeldorp
FORT 2.0. IJCAR (2018)
Christina Kohl, Aart Middeldorp
ProTeM: A Proof Term Manipulator (System Description). FSCD (2018)
Amy P. Felty, Aart Middeldorp
Preface: Selected Extended Papers of CADE 2015. J. Autom. Reason. 58 (3) (2017)
Julian Nagele, Bertram Felgenhauer, Aart Middeldorp
CSI: New Evidence - A Progress Report. CADE (2017)
Bertram Felgenhauer, Aart Middeldorp
Constructing Cycles in the Simplex Method for DPLL(T). ICTAC (2017)
Julian Nagele, Aart Middeldorp
CoCoWeb - A Convenient Web Interface for Confluence Tools. CoRR (2017)
Cynthia Kop, Aart Middeldorp, Thomas Sternagel
Complexity of Conditional Term Rewriting. Log. Methods Comput. Sci. 13 (1) (2017)
Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler
Infinite Runs in Abstract Completion. FSCD (2017)
Julian Nagele, Aart Middeldorp
Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems. ITP (2016)
Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
AC-KBO revisited. Theory Pract. Log. Program. 16 (2) (2016)
Franziska Rapp, Aart Middeldorp
Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems. FSCD (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)
Nao Hirokawa, Aart Middeldorp, Georg Moser
Leftmost Outermost Revisited. RTA (2015)
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom
Layer Systems for Proving Confluence. ACM Trans. Comput. Log. 16 (2) (2015)
Cynthia Kop, Aart Middeldorp, Thomas Sternagel
Conditional Complexity. RTA (2015)
Julian Nagele, Bertram Felgenhauer, Aart Middeldorp
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules. RTA (2015)
Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
AC-KBO Revisited. CoRR (2014)
Nao Hirokawa, Aart Middeldorp, Christian Sternagel
A New and Formalized Proof of Abstract Completion. ITP (2014)
Friedrich Neurauter, Aart Middeldorp
Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited. Log. Methods Comput. Sci. 10 (3) (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)
Thomas Sternagel, Aart Middeldorp
Conditional Confluence (System Description). RTA-TLCA (2014)
Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp
AC-KBO Revisited. FLOPS (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)
Sarah Winkler, Aart Middeldorp
Normalized Completion Revisited. RTA (2013)
Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara
Multi-Completion with Termination Tools. J. Autom. Reason. 50 (3) (2013)
Takahito Aoto, Aart Middeldorp
Preface. Theor. Comput. Sci. 464 (2012)
Sarah Winkler, Harald Zankl, Aart Middeldorp
Ordinals and Knuth-Bendix Orders. LPAR (2012)
Friedrich Neurauter, Aart Middeldorp
On the Domain and Dimension Hierarchy of Matrix Interpretations. LPAR (2012)
Aart Middeldorp
Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems. LPAR (2012)
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
CSI - A Confluence Tool. CADE (2011)
Nao Hirokawa, Aart Middeldorp
Decreasing Diagrams and Relative Termination. J. Autom. Reason. 47 (4) (2011)
Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI (2011)
Friedrich Neurauter, Aart Middeldorp
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. RTA (2011)
Bertram Felgenhauer, Harald Zankl, Aart Middeldorp
Layer Systems for Proving Confluence. FSTTCS (2011)
Sarah Winkler, Aart Middeldorp
AC Completion with Termination Tools. CADE (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)
Nao Hirokawa, Aart Middeldorp
Decreasing Diagrams and Relative Termination. IJCAR (2010)
Sarah Winkler, Aart Middeldorp
Termination Tools in Ordered Completion. IJCAR (2010)
Friedrich Neurauter, Harald Zankl, Aart Middeldorp
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. LPAR (Yogyakarta) (2010)
Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara
Optimizing mkbTT. 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)
Friedrich Neurauter, Aart Middeldorp
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. RTA (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)
Martin Korp, Aart Middeldorp
Match-bounds revisited. Inf. Comput. 207 (11) (2009)
Martin Korp, Aart Middeldorp
Beyond Dependency Graphs. CADE (2009)
Aart Middeldorp
Preface. Electron. Notes Theor. Comput. Sci. 237 (2009)
Irène Durand, Aart Middeldorp
On the Complexity of Deciding Call-by-Need CoRR (2009)
Haruhiko Sato, Masahito Kurihara, Sarah Winkler, Aart Middeldorp
Constraint-Based Multi-Completion Procedures for Term Rewriting Systems. IEICE Trans. Inf. Syst. (2) (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)
Nao Hirokawa, Aart Middeldorp
Decreasing Diagrams and Relative Termination CoRR (2009)
René Thiemann, Aart Middeldorp
Innermost Termination of Rewrite Systems by Labeling. Electron. Notes Theor. Comput. Sci. 204 (2008)
Harald Zankl, Aart Middeldorp
Increasing Interpretations. AISC/MKM/Calculemus (2008)
Martin Korp, Aart Middeldorp
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. LATA (2008)
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp
Multi-completion with Termination Tools (System Description). IJCAR (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)
Christian Sternagel, Aart Middeldorp
Root-Labeling. RTA (2008)
Adam Koprowski, Aart Middeldorp
Predictive Labeling with Dependency Pairs Using SAT. CADE (2007)
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)
Martin Korp, Aart Middeldorp
Proving Termination of Rewrite Systems Using Bounds. RTA (2007)
Nao Hirokawa, Aart Middeldorp
Tyrolean termination tool: Techniques and features. Inf. Comput. 205 (4) (2007)
Harald Zankl, Aart Middeldorp
Satisfying KBO Constraints. RTA (2007)

Aart Middeldorp.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Aart Middeldorp