A procedure for automatically proving the termination of a set of rewrite rules

  • David Detlefs
  • Randy Forgaard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 202)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Dershowitz 82]
    N. Dershowitz, "Orderings for Term-Rewriting Systems," in Theoretical Computer Science, Vol. 17, North-Holland, 1982, pp. 279–301. Preliminary version in Proc. 20th IEEE Symp. on Foundations of Computer Science, San Juan, Puerto Rico, October 1979, pp. 123–131.Google Scholar
  2. [Forgaard 84]
    R. Forgaard, "A Program for Generating and Analyzing Term Rewriting Systems," Master's Thesis, MIT Lab. for Computer Science, September 1984.Google Scholar
  3. [Jouannaud 82]
    J.-P. Jouannaud, P. Lescanne, and F. Reinig, "Recursive Decomposition Ordering," Proc. 2nd IFIP Workshop on Formal Description of Programming Concepts, Garmisch-Partenkirchen, W. Germany, June 1982. Also in "Recursive Decomposition Ordering and Multiset Orderings," Technical Memo TM-219, MIT Lab. for Computer Science, June 1982.Google Scholar
  4. [Kamin 80]
    S. Kamin and J.-J. Lévy, "Attempts for Generalising the Recursive Path Orderings," Dept. of Computer Science, Univ. of Illinois, Urbana-Champaign, February 1980. Unpublished manuscript.Google Scholar
  5. [Lankford 75a]
    D. S. Lankford, "Canonical Algebraic Simplification in Computational Logic," Technical Report ATP-25, Automatic Theorem Proving Project, Univ. of Texas, Austin, May 1975.Google Scholar
  6. [Lankford 75b]
    D. S. Lankford, "Canonical Inference," Technical Report ATP-32, Mathematics Dept., Univ. of Texas, Austin, December 1975.Google Scholar
  7. [Lankford 79]
    D. S. Lankford, "On Proving Term Rewriting Systems are Noetherian," Technical Report MTP-3, Mathematics Dept., Louisiana Tech. Univ., May 1979.Google Scholar
  8. [Lescanne 83]
    P. Lescanne, "Computer Experiments with the REVE Term Rewriting System Generator," Proc. 10th ACM Symp. on Principles of Programming Languages, Austin, TX, January 1983, pp. 99–108.Google Scholar
  9. [Lescanne 84]
    P. Lescanne, "Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status," Proc. of 6th Colloq. on Trees in Algebra and Programming, Bordeaux, France, Cambridge Univ. Press, March 1984. Also as "How to Prove Termination? An Approach to the Implementation of a new Recursive Decomposition Ordering," Proc. of an NSF Workshop on the Rewrite Rule Laboratory, Sept. 6–9, 1983, General Electric Corporate Research and Development Report No. 84GEN008, Schenectady, NY, April 1984, pp. 109–121.Google Scholar
  10. [Plaisted 84]
    D. A. Plaisted, private communication, January 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • David Detlefs
    • 1
  • Randy Forgaard
    • 1
  1. 1.MIT Laboratory for Computer ScienceUSA

Personalised recommendations