Aart Middeldorp

Nao Hirokawa, Aart Middeldorp, Harald Zankl: Uncurrying for Termination and Complexity. J. Autom. Reasoning 50(3): 279-315 (2013)

Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara: Multi-Completion with Termination Tools. J. Autom. Reasoning 50(3): 317-354 (2013)

Takahito Aoto, Aart Middeldorp: Preface. Theor. Comput. Sci. 464: 1-2 (2012)

Aart Middeldorp: Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems. LPAR 2012: 12

Friedrich Neurauter, Aart Middeldorp: On the Domain and Dimension Hierarchy of Matrix Interpretations. LPAR 2012: 320-334

Sarah Winkler, Harald Zankl, Aart Middeldorp: Ordinals and Knuth-Bendix Orders. LPAR 2012: 420-434

Nao Hirokawa, Aart Middeldorp: Decreasing Diagrams and Relative Termination. J. Autom. Reasoning 47(4): 481-501 (2011)

Sarah Winkler, Aart Middeldorp: AC Completion with Termination Tools. CADE 2011: 492-498

Harald Zankl, Bertram Felgenhauer, Aart Middeldorp: CSI - A Confluence Tool. CADE 2011: 499-505

Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI 2011: 1-20

Bertram Felgenhauer, Harald Zankl, Aart Middeldorp: Layer Systems for Proving Confluence. FSTTCS 2011: 288-299

Friedrich Neurauter, Aart Middeldorp: Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. RTA 2011: 251-266

Harald Zankl, Bertram Felgenhauer, Aart Middeldorp: Labelings for Decreasing Diagrams. RTA 2011: 377-392

Nao Hirokawa, Aart Middeldorp: Decreasing Diagrams and Relative Termination. IJCAR 2010: 487-501

Friedrich Neurauter, Aart Middeldorp, Harald Zankl: Monotonicity Criteria for Polynomial Interpretations over the Naturals. IJCAR 2010: 502-517

Sarah Winkler, Aart Middeldorp: Termination Tools in Ordered Completion. IJCAR 2010: 518-532

Harald Zankl, Aart Middeldorp: Satisfiability of Non-linear (Ir)rational Arithmetic. LPAR (Dakar) 2010: 481-500

Friedrich Neurauter, Harald Zankl, Aart Middeldorp: Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. LPAR (Yogyakarta) 2010: 550-564

Friedrich Neurauter, Aart Middeldorp: Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. RTA 2010: 243-258

Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara: Optimizing mkbTT. RTA 2010: 373-384

Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp: Finding and Certifying Loops. SOFSEM 2010: 755-766

Harald Zankl, Nao Hirokawa, Aart Middeldorp: Uncurrying for Innermost Termination and Derivational Complexity. HOR 2010: 46-57

Harald Zankl, Aart Middeldorp: Increasing interpretations. Ann. Math. Artif. Intell. 56(1): 87-108 (2009)

Aart Middeldorp: Preface. Electr. Notes Theor. Comput. Sci. 237: 1-2 (2009)

Harald Zankl, Christian Sternagel, Aart Middeldorp: Transforming SAT into Termination of Rewriting. Electr. Notes Theor. Comput. Sci. 246: 199-214 (2009)

Martin Korp, Aart Middeldorp: Match-bounds revisited. Inf. Comput. 207(11): 1259-1283 (2009)

Haruhiko Sato, Masahito Kurihara, Sarah Winkler, Aart Middeldorp: Constraint-Based Multi-Completion Procedures for Term Rewriting Systems. IEICE Transactions 92-D(2): 220-234 (2009)

Harald Zankl, Nao Hirokawa, Aart Middeldorp: KBO Orientability. J. Autom. Reasoning 43(2): 173-201 (2009)

Martin Korp, Aart Middeldorp: Beyond Dependency Graphs. CADE 2009: 339-354

Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp: Tyrolean Termination Tool 2. RTA 2009: 295-304

Irène Durand, Aart Middeldorp: On the Complexity of Deciding Call-by-Need. CoRR abs/0901.0869 (2009)

Nao Hirokawa, Aart Middeldorp: Decreasing Diagrams and Relative Termination. CoRR abs/0910.2853 (2009)

René Thiemann, Aart Middeldorp: Innermost Termination of Rewrite Systems by Labeling. Electr. Notes Theor. Comput. Sci. 204: 3-19 (2008)

Harald Zankl, Aart Middeldorp: Increasing Interpretations. AISC/MKM/Calculemus 2008: 191-205

Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp: Multi-completion with Termination Tools (System Description). IJCAR 2008: 306-312

Martin Korp, Aart Middeldorp: Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. LATA 2008: 321-332

Nao Hirokawa, Aart Middeldorp, Harald Zankl: Uncurrying for Termination. LPAR 2008: 667-681

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125

Christian Sternagel, Aart Middeldorp: Root-Labeling. RTA 2008: 336-350

Nao Hirokawa, Aart Middeldorp: Tyrolean termination tool: Techniques and features. Inf. Comput. 205(4): 474-511 (2007)

Adam Koprowski, Aart Middeldorp: Predictive Labeling with Dependency Pairs Using SAT. CADE 2007: 410-425

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

Martin Korp, Aart Middeldorp: Proving Termination of Rewrite Systems Using Bounds. RTA 2007: 273-287

Harald Zankl, Aart Middeldorp: Satisfying KBO Constraints. RTA 2007: 389-403

Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354

Harald Zankl, Nao Hirokawa, Aart Middeldorp: Constraints for Argument Filterings. SOFSEM (1) 2007: 579-590

Nao Hirokawa, Aart Middeldorp: Predictive Labeling. RTA 2006: 313-327

Harald Zankl, Aart Middeldorp: Satisfying KBO Constraints. CoRR abs/cs/0608032 (2006)

Irène Durand, Aart Middeldorp: Decidable call-by-need computations in term rewriting. Inf. Comput. 196(2): 95-126 (2005)

Nao Hirokawa, Aart Middeldorp: Automating the dependency pair method. Inf. Comput. 199(1-2): 172-199 (2005)

Nao Hirokawa, Aart Middeldorp: Tyrolean Termination Tool. RTA 2005: 175-184

Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel C. de Vrijer (Eds.): Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 3838, Springer 2005, isbn 3-540-30911-X

Jürgen Giesl, Aart Middeldorp: Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4): 379-427 (2004)

Nao Hirokawa, Aart Middeldorp: Polynomial Interpretations with Negative Coefficients. AISC 2004: 185-198

Mircea Marin, Aart Middeldorp: New completeness results for lazy conditional narrowing. PPDP 2004: 120-131

Nao Hirokawa, Aart Middeldorp: Dependency Pairs Revisited. RTA 2004: 249-268

Aart Middeldorp: Preface. Inf. Comput. 183(2): 139 (2003)

Nao Hirokawa, Aart Middeldorp: Automating the Dependency Pair Method. CADE 2003: 32-46

Nao Hirokawa, Aart Middeldorp: Tsukuba Termination Tool. RTA 2003: 311-320

Aart Middeldorp: Approximations for Strategies and Termination. Electr. Notes Theor. Comput. Sci. 70(6): 1-20 (2002)

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)

Aart Middeldorp, Taro Suzuki, Mohamed Hamada: Complete Selection Functions for a Lazy Conditional Narrowing Calculus. Journal of Functional and Logic Programming 2002 (2002)

Jürgen Giesl, Aart Middeldorp: Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory 2002: 231-244

Aart Middeldorp: Approximating Dependency Graphs Using Tree Automata Techniques. IJCAR 2001: 593-610

Taro Suzuki, Aart Middeldorp: A Complete Selection Function for Lazy Conditional Narrowing. FLOPS 2001: 201-215

Irène Durand, Aart Middeldorp: On the Modularity of Deciding Call-by-Need. FoSSaCS 2001: 199-213

Aart Middeldorp (Ed.): Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings. Lecture Notes in Computer Science 2051, Springer 2001, isbn 3-540-42117-3

Aart Middeldorp, Hitoshi Ohsaki: Type Introduction for Equational Rewriting. Acta Inf. 36(12): 1007-1029 (2000)

Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp: Logicality of conditional rewrite systems. Theor. Comput. Sci. 236(1-2): 209-232 (2000)

Jürgen Giesl, Aart Middeldorp: Eliminating Dummy Elimination. CADE 2000: 309-323

Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl: Equational Termination by Semantic Labelling. CSL 2000: 457-471

Aart Middeldorp: Term Rewriting. CSL 1999: 577

Jürgen Giesl, Aart Middeldorp: Transforming Context-Sensitive Rewrite Systems. RTA 1999: 271-287

Aart Middeldorp, Taisuke Sato (Eds.): Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings. Lecture Notes in Computer Science 1722, Springer 1999, isbn 3-540-66677-X

Michael Hanus, Salvador Lucas, Aart Middeldorp: Strongly Sequential and Inductively Sequential Term Rewriting Systems. Inf. Process. Lett. 67(1): 1-8 (1998)

Aart Middeldorp, Satoshi Okui: A Deterministic Lazy Narrowing Calculus. J. Symb. Comput. 25(6): 733-757 (1998)

Aart Middeldorp, Hans Zantema: Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175(1): 127-158 (1997)

Irène Durand, Aart Middeldorp: Decidable Call by Need Computations in term Rewriting (Extended Abstract). CADE 1997: 4-18

Hitoshi Ohsaki, Aart Middeldorp: Type Introduction for Equational Rewriting. LFCS 1997: 283-293

Aart Middeldorp: Call by Need Computations to Root-Stable Form. POPL 1997: 94-105

Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp: Logicality of Conditional Rewrite Systems. TAPSOFT 1997: 141-152

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248

Sergio Antoy, Aart Middeldorp: A Sequential Reduction Strategy. Theor. Comput. Sci. 165(1): 75-95 (1996)

Aart Middeldorp, Satoshi Okui, Tetsuo Ida: Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. 167(1&2): 95-130 (1996)

Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema: Transforming Termination by Self-Labelling. CADE 1996: 373-387

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166

Aart Middeldorp, Bernhard Gramlich: Simple termination is difficult. Appl. Algebra Eng. Commun. Comput. 6: 115-128 (1995)

Koichi Nakahara, Aart Middeldorp, Tetsuo Ida: A Complete Narrowing Calculus for Higher-Order Functional Logic Programming. PLILP 1995: 97-114

Taro Suzuki, Aart Middeldorp, Tetsuo Ida: Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. RTA 1995: 179-193

Satoshi Okui, Aart Middeldorp, Tetsuo Ida: Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT 1995: 394-408

Aart Middeldorp, Erik Hamoen: Completeness Results for Basic Narrowing. Appl. Algebra Eng. Commun. Comput. 5: 213-253 (1994)

Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer: Modularity of Confluence: A Simplified Proof. Inf. Process. Lett. 49(2): 101-109 (1994)

Aart Middeldorp: Completeness of Combinations of Conditional Constructor Systems. J. Symb. Comput. 17(1): 3-21 (1994)

Sergio Antoy, Aart Middeldorp: A Sequential Reduction Strategy. ALP 1994: 168-185

Aart Middeldorp, Hans Zantema: Simple Termination Revisited. CADE 1994: 451-465

Aart Middeldorp: Modular Properties of Conditional Term Rewriting Systems. Inf. Comput. 104(1): 110-158 (1993)

Aart Middeldorp, Yoshihito Toyama: Completeness of Combinations of Constructor Systems. J. Symb. Comput. 15(3): 331-348 (1993)

Aart Middeldorp, Bernhard Gramlich: Simple Termination is Difficult. RTA 1993: 228-242

Aart Middeldorp, Erik Hamoen: Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). ALP 1992: 244-258

Aart Middeldorp: Completeness of Combinations of Conditional Constructor Systems. CTRS 1992: 82-96

Jan Willem Klop, Aart Middeldorp: Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. 12(2): 161-196 (1991)

Aart Middeldorp, Yoshihito Toyama: Completeness of Combinations of Constructor Systems. RTA 1991: 188-199

Aart Middeldorp: Confluence of the Disjoint Union of Conditional Term Rewriting Systems. CTRS 1990: 295-306

Aart Middeldorp: A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems. LICS 1989: 396-401

Aart Middeldorp: Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms. RTA 1989: 263-277