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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 202 LNCS, Issue , 1985, Pages 255-270

  Detlefs, David ^a,b   Forgaard, Randy ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034967034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-15976-2_12     Document Type: Conference Paper

References (10)

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.
2. R. Forgaard, "A Program for Generating and Analyzing Term Rewriting Systems," Master’s Thesis, MIT Lab. for Computer Science, September 1984.
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.
4. S. Kamin and J.-J. Levy, "Attempts for Generalising the Recursive Path Orderings," Dept, of Computer Science, Univ. of Illinois, Urbana-Champaign, February 1980. Unpublished manuscript.
5. D. S. Lankford, "Canonical Algebraic Simplification in Computational Logic," Technical Report ATP-25, Automatic Theorem Proving Project, Univ. of Texas, Austin, May 1975.
6. D. S. Lankford, "Canonical Inference," Technical Report ATP-32, Mathematics Dept., Univ. of Texas, Austin, December 1975.
7. D. S. Lankford, "On Proving Term Rewriting Systems are Noetherian," Technical Report MTP-3, Mathematics Dept., Louisiana Tech. Univ., May 1979.
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.
9. P. Lescanne, "Uniform Termination of Term Rewriting Systems: Recursive Decomposition Ordering with Status,"Proc. Of 6th Coiloq. 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.
10. D. A. Plaisted, private communication, January 1984.