Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 202))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. R. Forgaard, "A Program for Generating and Analyzing Term Rewriting Systems," Master's Thesis, MIT Lab. for Computer Science, September 1984.

    Google Scholar 

  3. 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. 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. 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. D. S. Lankford, "Canonical Inference," Technical Report ATP-32, Mathematics Dept., Univ. of Texas, Austin, December 1975.

    Google Scholar 

  7. D. S. Lankford, "On Proving Term Rewriting Systems are Noetherian," Technical Report MTP-3, Mathematics Dept., Louisiana Tech. Univ., May 1979.

    Google Scholar 

  8. 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. 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. D. A. Plaisted, private communication, January 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT Laboratory for Computer Science, USA

    David Detlefs & Randy Forgaard

Authors
  1. David Detlefs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Randy Forgaard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Pierre Jouannaud

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Detlefs, D., Forgaard, R. (1985). A procedure for automatically proving the termination of a set of rewrite rules. In: Jouannaud, JP. (eds) Rewriting Techniques and Applications. RTA 1985. Lecture Notes in Computer Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15976-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-15976-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15976-6

  • Online ISBN: 978-3-540-39679-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation