| Completeness results for basic narrowing A Middeldorp, E Hamoen Applicable Algebra in Engineering, Communication and Computing 5 (3), 213-253, 1994 | 176 | 1994 |
| SAT solving for termination analysis with polynomial interpretations C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl International Conference on Theory and Applications of Satisfiability …, 2007 | 172 | 2007 |
| Tyrolean termination tool 2 M Korp, C Sternagel, H Zankl, A Middeldorp International Conference on Rewriting Techniques and Applications, 295-304, 2009 | 163 | 2009 |
| Tyrolean termination tool: Techniques and features N Hirokawa, A Middeldorp Information and Computation 205 (4), 474-511, 2007 | 158 | 2007 |
| Modular properties of term rewriting systems A Middeldorp Vrije Universiteit Amsterdam, 1990 | 150 | 1990 |
| Automating the dependency pair method N Hirokawa, A Middeldorp Information and computation 199 (1-2), 172-199, 2005 | 139 | 2005 |
| Sequentiality in orthogonal term rewriting systems JW Klop, A Middeldorp Journal of symbolic computation 12 (2), 161-195, 1991 | 116 | 1991 |
| Dependency pairs revisited N Hirokawa, A Middeldorp International Conference on Rewriting Techniques and Applications, 249-268, 2004 | 105 | 2004 |
| Call by need computations to root-stable form A Middeldorp Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of …, 1997 | 99 | 1997 |
| Lazy narrowing: Strong completeness and eager variable elimination A Middeldorp, S Okui, T Ida Theoretical Computer Science 167 (1-2), 95-130, 1996 | 98 | 1996 |
| A sufficient condition for the termination of the direct sum of term rewriting systems A Middeldorp Proceedings. Fourth Annual Symposium on Logic in Computer Science, 396,397 …, 1989 | 98 | 1989 |
| Completeness of combinations of constructor systems A Middeldorp, Y Toyama International Conference on Rewriting Techniques and Applications, 188-199, 1991 | 93 | 1991 |
| Transformation techniques for context-sensitive rewrite systems J Giesl, A Middeldorp Journal of Functional Programming 14 (4), 379-427, 2004 | 88 | 2004 |
| Satisfiability of non-linear (ir) rational arithmetic H Zankl, A Middeldorp International Conference on Logic for Programming Artificial Intelligence …, 2010 | 82 | 2010 |
| Simple termination of rewrite systems A Middeldorp, H Zantema Theoretical Computer Science 175 (1), 127-158, 1997 | 74 | 1997 |
| Modular aspects of properties of term rewriting systems related to normal forms A Middeldorp International Conference on Rewriting Techniques and Applications, 263-277, 1989 | 70 | 1989 |
| Level-confluence of conditional rewrite systems with extra variables in right-hand sides T Suzuki, A Middeldorp, T Ida International Conference on Rewriting Techniques and Applications, 179-193, 1995 | 69 | 1995 |
| CSI–A confluence tool H Zankl, B Felgenhauer, A Middeldorp International Conference on Automated Deduction, 499-505, 2011 | 65 | 2011 |
| A deterministic lazy narrowing calculus A Middeldorp, S Okui Journal of Symbolic Computation 25 (6), 733-757, 1998 | 62 | 1998 |
| Counterexamples to completeness results for basic narrowing A Middeldorp, E Hamoen International Conference on Algebraic and Logic Programming, 244-258, 1992 | 61 | 1992 |
