Aart Middeldorp

	2012
103		Aart Middeldorp: Matrix Interpretations for Polynomial Derivational Complexity of Rewrite Systems. LPAR 2012: 12
102		Friedrich Neurauter, Aart Middeldorp: On the Domain and Dimension Hierarchy of Matrix Interpretations. LPAR 2012: 320-334
101		Sarah Winkler, Harald Zankl, Aart Middeldorp: Ordinals and Knuth-Bendix Orders. LPAR 2012: 420-434
	2011
100		Sarah Winkler, Aart Middeldorp: AC Completion with Termination Tools. CADE 2011: 492-498
99		Harald Zankl, Bertram Felgenhauer, Aart Middeldorp: CSI - A Confluence Tool. CADE 2011: 499-505
98		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
97		Bertram Felgenhauer, Harald Zankl, Aart Middeldorp: Layer Systems for Proving Confluence. FSTTCS 2011: 288-299
96		Friedrich Neurauter, Aart Middeldorp: Revisiting Matrix Interpretations for Proving Termination of Term Rewriting. RTA 2011: 251-266
95		Harald Zankl, Bertram Felgenhauer, Aart Middeldorp: Labelings for Decreasing Diagrams. RTA 2011: 377-392
94		Nao Hirokawa, Aart Middeldorp: Decreasing Diagrams and Relative Termination. J. Autom. Reasoning 47(4): 481-501 (2011)
	2010
93		Harald Zankl, Nao Hirokawa, Aart Middeldorp: Uncurrying for Innermost Termination and Derivational Complexity HOR 2010: 46-57
92		Nao Hirokawa, Aart Middeldorp: Decreasing Diagrams and Relative Termination. IJCAR 2010: 487-501
91		Friedrich Neurauter, Aart Middeldorp, Harald Zankl: Monotonicity Criteria for Polynomial Interpretations over the Naturals. IJCAR 2010: 502-517
90		Sarah Winkler, Aart Middeldorp: Termination Tools in Ordered Completion. IJCAR 2010: 518-532
89		Harald Zankl, Aart Middeldorp: Satisfiability of Non-linear (Ir)rational Arithmetic. LPAR (Dakar) 2010: 481-500
88		Friedrich Neurauter, Harald Zankl, Aart Middeldorp: Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting. LPAR (Yogyakarta) 2010: 550-564
87		Friedrich Neurauter, Aart Middeldorp: Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. RTA 2010: 243-258
86		Sarah Winkler, Haruhiko Sato, Aart Middeldorp, Masahito Kurihara: Optimizing mkbTT. RTA 2010: 373-384
85		Harald Zankl, Christian Sternagel, Dieter Hofbauer, Aart Middeldorp: Finding and Certifying Loops. SOFSEM 2010: 755-766
	2009
84		Martin Korp, Aart Middeldorp: Beyond Dependency Graphs. CADE 2009: 339-354
83		Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp: Tyrolean Termination Tool 2. RTA 2009: 295-304
82		Harald Zankl, Aart Middeldorp: Increasing interpretations. Ann. Math. Artif. Intell. 56(1): 87-108 (2009)
81		Irène Durand, Aart Middeldorp: On the Complexity of Deciding Call-by-Need CoRR abs/0901.0869: (2009)
80		Nao Hirokawa, Aart Middeldorp: Decreasing Diagrams and Relative Termination CoRR abs/0910.2853: (2009)
79		Aart Middeldorp: Preface. Electr. Notes Theor. Comput. Sci. 237: 1-2 (2009)
78		Harald Zankl, Christian Sternagel, Aart Middeldorp: Transforming SAT into Termination of Rewriting. Electr. Notes Theor. Comput. Sci. 246: 199-214 (2009)
77		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)
76		Martin Korp, Aart Middeldorp: Match-bounds revisited. Inf. Comput. 207(11): 1259-1283 (2009)
75		Harald Zankl, Nao Hirokawa, Aart Middeldorp: KBO Orientability. J. Autom. Reasoning 43(2): 173-201 (2009)
	2008
74		Harald Zankl, Aart Middeldorp: Increasing Interpretations. AISC/MKM/Calculemus 2008: 191-205
73		Haruhiko Sato, Sarah Winkler, Masahito Kurihara, Aart Middeldorp: Multi-completion with Termination Tools (System Description). IJCAR 2008: 306-312
72		Martin Korp, Aart Middeldorp: Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. LATA 2008: 321-332
71		Nao Hirokawa, Aart Middeldorp, Harald Zankl: Uncurrying for Termination. LPAR 2008: 667-681
70		Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl: Maximal Termination. RTA 2008: 110-125
69		Christian Sternagel, Aart Middeldorp: Root-Labeling. RTA 2008: 336-350
68		René Thiemann, Aart Middeldorp: Innermost Termination of Rewrite Systems by Labeling. Electr. Notes Theor. Comput. Sci. 204: 3-19 (2008)
	2007
67		Adam Koprowski, Aart Middeldorp: Predictive Labeling with Dependency Pairs Using SAT. CADE 2007: 410-425
66		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
65		Martin Korp, Aart Middeldorp: Proving Termination of Rewrite Systems Using Bounds. RTA 2007: 273-287
64		Harald Zankl, Aart Middeldorp: Satisfying KBO Constraints. RTA 2007: 389-403
63		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
62		Harald Zankl, Nao Hirokawa, Aart Middeldorp: Constraints for Argument Filterings. SOFSEM (1) 2007: 579-590
61		Nao Hirokawa, Aart Middeldorp: Tyrolean termination tool: Techniques and features. Inf. Comput. 205(4): 474-511 (2007)
	2006
60		Nao Hirokawa, Aart Middeldorp: Predictive Labeling. RTA 2006: 313-327
59		Harald Zankl, Aart Middeldorp: Satisfying KBO Constraints CoRR abs/cs/0608032: (2006)
	2005
58		Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel C. de Vrijer: Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday Springer 2005
57		Nao Hirokawa, Aart Middeldorp: Tyrolean Termination Tool. RTA 2005: 175-184
56		Irène Durand, Aart Middeldorp: Decidable call-by-need computations in term rewriting. Inf. Comput. 196(2): 95-126 (2005)
55		Nao Hirokawa, Aart Middeldorp: Automating the dependency pair method. Inf. Comput. 199(1-2): 172-199 (2005)
	2004
54		Nao Hirokawa, Aart Middeldorp: Polynomial Interpretations with Negative Coefficients. AISC 2004: 185-198
53		Mircea Marin, Aart Middeldorp: New completeness results for lazy conditional narrowing. PPDP 2004: 120-131
52		Nao Hirokawa, Aart Middeldorp: Dependency Pairs Revisited. RTA 2004: 249-268
51		Jürgen Giesl, Aart Middeldorp: Transformation techniques for context-sensitive rewrite systems. J. Funct. Program. 14(4): 379-427 (2004)
	2003
50		Nao Hirokawa, Aart Middeldorp: Automating the Dependency Pair Method. CADE 2003: 32-46
49		Nao Hirokawa, Aart Middeldorp: Tsukuba Termination Tool. RTA 2003: 311-320
48		Aart Middeldorp: Preface. Inf. Comput. 183(2): 139 (2003)
	2002
47		Jürgen Giesl, Aart Middeldorp: Innermost Termination of Context-Sensitive Rewriting. Developments in Language Theory 2002: 231-244
46		Aart Middeldorp: Approximations for Strategies and Termination. Electr. Notes Theor. Comput. Sci. 70(6): 1-20 (2002)
45		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)
44		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)
43		Aart Middeldorp, Taro Suzuki, Mohamed Hamada: Complete Selection Functions for a Lazy Conditional Narrowing Calculus. Journal of Functional and Logic Programming 2002: (2002)
	2001
42		Aart Middeldorp: Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings Springer 2001
41		Taro Suzuki, Aart Middeldorp: A Complete Selection Function for Lazy Conditional Narrowing. FLOPS 2001: 201-215
40		Irène Durand, Aart Middeldorp: On the Modularity of Deciding Call-by-Need. FoSSaCS 2001: 199-213
39		Aart Middeldorp: Approximating Dependency Graphs Using Tree Automata Techniques. IJCAR 2001: 593-610
	2000
38		Jürgen Giesl, Aart Middeldorp: Eliminating Dummy Elimination. CADE 2000: 309-323
37		Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl: Equational Termination by Semantic Labelling. CSL 2000: 457-471
36		Aart Middeldorp, Hitoshi Ohsaki: Type Introduction for Equational Rewriting. Acta Inf. 36(12): 1007-1029 (2000)
35		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)
	1999
34		Aart Middeldorp, Taisuke Sato: Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings Springer 1999
33		Aart Middeldorp: Term Rewriting. CSL 1999: 577
32		Jürgen Giesl, Aart Middeldorp: Transforming Context-Sensitive Rewrite Systems. RTA 1999: 271-287
	1998
31		Michael Hanus, Salvador Lucas, Aart Middeldorp: Strongly Sequential and Inductively Sequential Term Rewriting Systems. Inf. Process. Lett. 67(1): 1-8 (1998)
30		Aart Middeldorp, Satoshi Okui: A Deterministic Lazy Narrowing Calculus. J. Symb. Comput. 25(6): 733-757 (1998)
	1997
29		Irène Durand, Aart Middeldorp: Decidable Call by Need Computations in term Rewriting (Extended Abstract). CADE 1997: 4-18
28		Hitoshi Ohsaki, Aart Middeldorp: Type Introduction for Equational Rewriting. LFCS 1997: 283-293
27		Aart Middeldorp: Call by Need Computations to Root-Stable Form. POPL 1997: 94-105
26		Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp: Logicality of Conditional Rewrite Systems. TAPSOFT 1997: 141-152
25		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248
24		Aart Middeldorp, Hans Zantema: Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175(1): 127-158 (1997)
	1996
23		Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema: Transforming Termination by Self-Labelling. CADE 1996: 373-387
22		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166
21		Sergio Antoy, Aart Middeldorp: A Sequential Reduction Strategy. Theor. Comput. Sci. 165(1): 75-95 (1996)
20		Aart Middeldorp, Satoshi Okui, Tetsuo Ida: Lazy Narrowing: Strong Completeness and Eager Variable Elimination. Theor. Comput. Sci. 167(1&2): 95-130 (1996)
	1995
19		Koichi Nakahara, Aart Middeldorp, Tetsuo Ida: A Complete Narrowing Calculus for Higher-Order Functional Logic Programming PLILP 1995: 97-114
18		Taro Suzuki, Aart Middeldorp, Tetsuo Ida: Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. RTA 1995: 179-193
17		Satoshi Okui, Aart Middeldorp, Tetsuo Ida: Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). TAPSOFT 1995: 394-408
16		Aart Middeldorp, Bernhard Gramlich: Simple termination is difficult. Appl. Algebra Eng. Commun. Comput. 6: 115-128 (1995)
	1994
15		Sergio Antoy, Aart Middeldorp: A Sequential Reduction Strategy. ALP 1994: 168-185
14		Aart Middeldorp, Hans Zantema: Simple Termination Revisited. CADE 1994: 451-465
13		Aart Middeldorp, Erik Hamoen: Completeness Results for Basic Narrowing. Appl. Algebra Eng. Commun. Comput. 5: 213-253 (1994)
12		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)
11		Aart Middeldorp: Completeness of Combinations of Conditional Constructor Systems. J. Symb. Comput. 17(1): 3-21 (1994)
	1993
10		Aart Middeldorp, Bernhard Gramlich: Simple Termination is Difficult. RTA 1993: 228-242
9		Aart Middeldorp: Modular Properties of Conditional Term Rewriting Systems Inf. Comput. 104(1): 110-158 (1993)
8		Aart Middeldorp, Yoshihito Toyama: Completeness of Combinations of Constructor Systems. J. Symb. Comput. 15(3): 331-348 (1993)
	1992
7		Aart Middeldorp, Erik Hamoen: Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). ALP 1992: 244-258
6		Aart Middeldorp: Completeness of Combinations of Conditional Constructor Systems. CTRS 1992: 82-96
	1991
5		Aart Middeldorp, Yoshihito Toyama: Completeness of Combinations of Constructor Systems. RTA 1991: 188-199
4		Jan Willem Klop, Aart Middeldorp: Sequentiality in Orthogonal Term Rewriting Systems. J. Symb. Comput. 12(2): 161-196 (1991)
	1990
3		Aart Middeldorp: Confluence of the Disjoint Union of Conditional Term Rewriting Systems. CTRS 1990: 295-306
	1989
2		Aart Middeldorp: A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems LICS 1989: 396-401
1		Aart Middeldorp: Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms. RTA 1989: 263-277

Coauthor Index

1	Elena Annov	[66]
2	Sergio Antoy	[15] [21]
3	Jürgen Avenhaus	[26] [35]
4	Michael Codish	[66]
5	Irène Durand	[29] [40] [56] [81]
6	Bertram Felgenhauer	[95] [97] [99]
7	Carsten Fuhs	[63] [66] [70]
8	Alfons Geser	[22] [25] [44] [45]
9	Jürgen Giesl	[32] [37] [38] [47] [51] [63] [66] [70]
10	Bernhard Gramlich	[10] [16]
11	Mohamed Hamada	[43]
12	Erik Hamoen	[7] [13]
13	Michael Hanus	[31]
14	Nao Hirokawa	[49] [50] [52] [54] [55] [57] [60] [61] [62] [71] [75] [80] [92] [93] [94]
15	Dieter Hofbauer	[85]
16	Tetsuo Ida	[17] [18] [19] [20]
17	Jan Willem Klop	[4] [12]
18	Adam Koprowski	[67]
19	Martin Korp	[65] [72] [76] [83] [84]
20	Masahito Kurihara	[73] [77] [86]
21	Carlos Loría-Sáenz	[26] [35]
22	Salvador Lucas	[31]
23	Mircea Marin	[53]
24	Georg Moser	[98]
25	Koichi Nakahara	[19]
26	Friedrich Neurauter	[87] [88] [91] [96] [98] [102]
27	Enno Ohlebusch	[22] [25] [44] [45]
28	Hitoshi Ohsaki	[23] [28] [36] [37]
29	Satoshi Okui	[17] [20] [30]
30	Vincent van Oostrom	[58]
31	Femke van Raamsdonk	[58]
32	Haruhiko Sato	[73] [77] [86]
33	Taisuke Sato	[34]
34	Peter Schneider-Kamp	[63] [66] [70]
35	Christian Sternagel	[69] [78] [83] [85]
36	Taro Suzuki	[18] [41] [43]
37	René Thiemann	[63] [66] [68] [70]
38	Yoshihito Toyama	[5] [8] [12]
39	Roel C. de Vrijer	[12] [58]
40	Johannes Waldmann	[98]
41	Sarah Winkler	[73] [77] [86] [90] [100] [101]
42	Toshiyuki Yamada	[26] [35]
43	Harald Zankl	[59] [62] [63] [64] [66] [70] [71] [74] [75] [78] [82] [83] [85] [88] [89] [91] [93] [95] [97] [98] [99] [101]
44	Hans Zantema	[14] [22] [23] [24] [25] [44] [45]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page