The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Aart Middeldorp: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nao Hirokawa, Aart Middeldorp
    Polynomial Interpretations with Negative Coefficients. [Citation Graph (0, 0)][DBLP]
    AISC, 2004, pp:185-198 [Conf]
  2. Sergio Antoy, Aart Middeldorp
    A Sequential Reduction Strategy. [Citation Graph (0, 0)][DBLP]
    ALP, 1994, pp:168-185 [Conf]
  3. Aart Middeldorp, Erik Hamoen
    Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:244-258 [Conf]
  4. Irène Durand, Aart Middeldorp
    Decidable Call by Need Computations in term Rewriting (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1997, pp:4-18 [Conf]
  5. Jürgen Giesl, Aart Middeldorp
    Eliminating Dummy Elimination. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:309-323 [Conf]
  6. Nao Hirokawa, Aart Middeldorp
    Automating the Dependency Pair Method. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:32-46 [Conf]
  7. Aart Middeldorp
    Approximating Dependency Graphs Using Tree Automata Techniques. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:593-610 [Conf]
  8. Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema
    Transforming Termination by Self-Labelling. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:373-387 [Conf]
  9. Aart Middeldorp, Hans Zantema
    Simple Termination Revisited. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:451-465 [Conf]
  10. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
    Relative Undecidability in Term Rewriting. [Citation Graph (0, 0)][DBLP]
    CSL, 1996, pp:150-166 [Conf]
  11. Aart Middeldorp
    Term Rewriting. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:577- [Conf]
  12. Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl
    Equational Termination by Semantic Labelling. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:457-471 [Conf]
  13. Aart Middeldorp
    Confluence of the Disjoint Union of Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1990, pp:295-306 [Conf]
  14. Aart Middeldorp
    Completeness of Combinations of Conditional Constructor Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:82-96 [Conf]
  15. Jürgen Giesl, Aart Middeldorp
    Innermost Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:231-244 [Conf]
  16. Taro Suzuki, Aart Middeldorp
    A Complete Selection Function for Lazy Conditional Narrowing. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2001, pp:201-215 [Conf]
  17. Irène Durand, Aart Middeldorp
    On the Modularity of Deciding Call-by-Need. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:199-213 [Conf]
  18. Hitoshi Ohsaki, Aart Middeldorp
    Type Introduction for Equational Rewriting. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:283-293 [Conf]
  19. Aart Middeldorp
    A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:396-401 [Conf]
  20. Koichi Nakahara, Aart Middeldorp, Tetsuo Ida
    A Complete Narrowing Calculus for Higher-Order Functional Logic Programming [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:97-114 [Conf]
  21. Aart Middeldorp
    Call by Need Computations to Root-Stable Form. [Citation Graph (0, 0)][DBLP]
    POPL, 1997, pp:94-105 [Conf]
  22. Mircea Marin, Aart Middeldorp
    New completeness results for lazy conditional narrowing. [Citation Graph (0, 0)][DBLP]
    PPDP, 2004, pp:120-131 [Conf]
  23. Jürgen Giesl, Aart Middeldorp
    Transforming Context-Sensitive Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:271-287 [Conf]
  24. Nao Hirokawa, Aart Middeldorp
    Tsukuba Termination Tool. [Citation Graph (0, 0)][DBLP]
    RTA, 2003, pp:311-320 [Conf]
  25. Nao Hirokawa, Aart Middeldorp
    Dependency Pairs Revisited. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:249-268 [Conf]
  26. Nao Hirokawa, Aart Middeldorp
    Tyrolean Termination Tool. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:175-184 [Conf]
  27. Nao Hirokawa, Aart Middeldorp
    Predictive Labeling. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:313-327 [Conf]
  28. Aart Middeldorp
    Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:263-277 [Conf]
  29. Aart Middeldorp, Bernhard Gramlich
    Simple Termination is Difficult. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:228-242 [Conf]
  30. Aart Middeldorp, Yoshihito Toyama
    Completeness of Combinations of Constructor Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:188-199 [Conf]
  31. Taro Suzuki, Aart Middeldorp, Tetsuo Ida
    Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. [Citation Graph (0, 0)][DBLP]
    RTA, 1995, pp:179-193 [Conf]
  32. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
    Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:237-248 [Conf]
  33. Satoshi Okui, Aart Middeldorp, Tetsuo Ida
    Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:394-408 [Conf]
  34. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
    Logicality of Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:141-152 [Conf]
  35. Aart Middeldorp, Bernhard Gramlich
    Simple Termination Difficult. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1995, v:6, n:, pp:115-128 [Journal]
  36. Aart Middeldorp, Erik Hamoen
    Completness Results for Basic Narrowing. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:213-253 [Journal]
  37. Aart Middeldorp, Hitoshi Ohsaki
    Type Introduction for Equational Rewriting. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2000, v:36, n:12, pp:1007-1029 [Journal]
  38. Aart Middeldorp
    Approximations for Strategies and Termination. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:6, pp:- [Journal]
  39. Irène Durand, Aart Middeldorp
    Decidable call-by-need computations in term rewriting. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:196, n:2, pp:95-126 [Journal]
  40. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
    Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:101-131 [Journal]
  41. Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
    Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:132-148 [Journal]
  42. Nao Hirokawa, Aart Middeldorp
    Automating the dependency pair method. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:199, n:1-2, pp:172-199 [Journal]
  43. Aart Middeldorp
    Preface. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:2, pp:139- [Journal]
  44. Aart Middeldorp
    Modular Properties of Conditional Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:1, pp:110-158 [Journal]
  45. Michael Hanus, Salvador Lucas, Aart Middeldorp
    Strongly Sequential and Inductively Sequential Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:1, pp:1-8 [Journal]
  46. Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer
    Modularity of Confluence: A Simplified Proof. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:2, pp:101-109 [Journal]
  47. Aart Middeldorp, Taro Suzuki, Mohamed Hamada
    Complete Selection Functions for a Lazy Conditional Narrowing Calculus. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2002, v:2002, n:, pp:- [Journal]
  48. Jürgen Giesl, Aart Middeldorp
    Transformation techniques for context-sensitive rewrite systems. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:4, pp:379-427 [Journal]
  49. Jan Willem Klop, Aart Middeldorp
    Sequentiality in Orthogonal Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:2, pp:161-196 [Journal]
  50. Aart Middeldorp
    Completeness of Combinations of Conditional Constructor Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:17, n:1, pp:3-21 [Journal]
  51. Aart Middeldorp, Satoshi Okui
    A Deterministic Lazy Narrowing Calculus. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1998, v:25, n:6, pp:733-757 [Journal]
  52. Aart Middeldorp, Yoshihito Toyama
    Completeness of Combinations of Constructor Systems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1993, v:15, n:3, pp:331-348 [Journal]
  53. Sergio Antoy, Aart Middeldorp
    A Sequential Reduction Strategy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:1, pp:75-95 [Journal]
  54. Aart Middeldorp, Satoshi Okui, Tetsuo Ida
    Lazy Narrowing: Strong Completeness and Eager Variable Elimination. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:167, n:1&2, pp:95-130 [Journal]
  55. Aart Middeldorp, Hans Zantema
    Simple Termination of Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:1, pp:127-158 [Journal]
  56. Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
    Logicality of conditional rewrite systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:236, n:1-2, pp:209-232 [Journal]
  57. Adam Koprowski, Aart Middeldorp
    Predictive Labeling with Dependency Pairs Using SAT. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:410-425 [Conf]
  58. Harald Zankl, Aart Middeldorp
    Satisfying KBO Constraints. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:389-403 [Conf]
  59. Martin Korp, Aart Middeldorp
    Proving Termination of Rewrite Systems Using Bounds. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:273-287 [Conf]
  60. Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl
    SAT Solving for Termination Analysis with Polynomial Interpretations. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:340-354 [Conf]
  61. Harald Zankl, Nao Hirokawa, Aart Middeldorp
    Constraints for Argument Filterings. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:579-590 [Conf]
  62. Harald Zankl, Aart Middeldorp
    Satisfying KBO Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  63. Nao Hirokawa, Aart Middeldorp
    Tyrolean termination tool: Techniques and features. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:4, pp:474-511 [Journal]

  64. Increasing Interpretations. [Citation Graph (, )][DBLP]


  65. Multi-completion with Termination Tools (System Description). [Citation Graph (, )][DBLP]


  66. Beyond Dependency Graphs. [Citation Graph (, )][DBLP]


  67. Monotonicity Criteria for Polynomial Interpretations over the Naturals. [Citation Graph (, )][DBLP]


  68. Decreasing Diagrams and Relative Termination. [Citation Graph (, )][DBLP]


  69. Termination Tools in Ordered Completion. [Citation Graph (, )][DBLP]


  70. Implementing RPO and POLO using SAT. [Citation Graph (, )][DBLP]


  71. Uncurrying for Termination. [Citation Graph (, )][DBLP]


  72. Tyrolean Termination Tool 2. [Citation Graph (, )][DBLP]


  73. Root-Labeling. [Citation Graph (, )][DBLP]


  74. Maximal Termination. [Citation Graph (, )][DBLP]


  75. Optimizing mkbTT. [Citation Graph (, )][DBLP]


  76. Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers. [Citation Graph (, )][DBLP]


  77. Finding and Certifying Loops. [Citation Graph (, )][DBLP]


  78. Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. [Citation Graph (, )][DBLP]


  79. Increasing interpretations. [Citation Graph (, )][DBLP]


  80. On the Complexity of Deciding Call-by-Need [Citation Graph (, )][DBLP]


  81. Decreasing Diagrams and Relative Termination [Citation Graph (, )][DBLP]


  82. Innermost Termination of Rewrite Systems by Labeling. [Citation Graph (, )][DBLP]


  83. Preface. [Citation Graph (, )][DBLP]


  84. Transforming SAT into Termination of Rewriting. [Citation Graph (, )][DBLP]


Search in 0.107secs, Finished in 0.113secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002