Skip to main content

Advertisement

Springer Nature Link
Log in

Mechanizing Weakly Ground Termination Proving of Term Rewriting Systems by Structural and Cover-Set Inductions

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The paper presents three formal proving methods for generalized weakly ground terminating property, i.e., weakly terminating property in a restricted domain of a term rewriting system, one with structural induction, one with cover-set induction, and the third without induction, and describes their mechanization based on a meta-computation model for term rewriting systems—dynamic term rewriting calculus. The methods can be applied to non-terminating, non-confluent and/or non-left-linear term rewriting systems. They can do “forward proving” by applying propositions in the proof, as well as “backward proving” by discovering lemmas during the proof.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Heut G, Lankford D S. On the uniform halting problem for term rewriting systems. Technical Report 283, Laboria, France, 1978.

  2. Middeldorp A, Zantema H. Simple termination of rewrite systems. Theoretical Computer Science, 1997, 175: 127–158.

    Article  MathSciNet  Google Scholar 

  3. Toyama Y. How to prove equivalence of term rewriting systems without induction. Theoretical Computer Science, 1991, 90: 369–390.

    Article  MATH  MathSciNet  Google Scholar 

  4. Feng S. An inductive proving method for weakly ground termination of term rewriting systems. Computer Science, 2001, 28(7): 105–108. (in Chinese)

    Google Scholar 

  5. Zhang H, Kapur K, Krishnamoorthy M S. A mechanizable induction principle for equational specification. In Proc. 9th Int. Conf. Automated Deduction at Argonne, Illinois, USA, Lecture Notes in Computer Science 310, May 1988, pp.162–181.

  6. Sakai M, Sakabe T, Inagaki Y. Cover set induction for verifying algebraic specifications. The Transaction of the Institute of Electronics, Information and Communication Engineers, 1992, J75-D-I(3): 170–179. (in Japanese)

  7. Feng S, Sakabe T, Inagaki Y. Mechanizing explicit inductive equational reasoning by DTRC. IEICE Trans. Information and Systems, 1995, E78-D(2): 113–121.

    Google Scholar 

  8. Feng S, Cao S, Liu S. Mechanizing weak termination proving of term rewriting systems by induction. In Proc. Sixth Int. Conf. Young Computer Scientists, Oct. 2001, Hangzhou, P.R. China, pp.15–19.

  9. Feng S, Sakabe T, Inagaki Y. Confluence property of simple frames in dynamic term rewriting calculus. IEICE Trans. Information and Systems, 1997, E80-D(6): 625–645.

    Google Scholar 

  10. Huet G. Confluent reductions: Abstract properties and applications to term rewriting systems. J. ACM, 1980, 27: 797–821.

    Article  MATH  MathSciNet  Google Scholar 

  11. Feng S. Equivalence proving of term rewriting systems by induction. Computer Science, 2000, 27(8): 5–7. (in Chinese)

    Google Scholar 

  12. Gramlich B. Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamentae Informaticae (special issue on term rewriting systems), 1995, 24: 3–23.

    MATH  MathSciNet  Google Scholar 

  13. A Serebrenik, D De Schreye. On Termination of Meta-programs. In Logic for Programming, AI, and Reasoning, Proceedings, Nieuwenhuis R, Voronkov A (eds.), Lecture Notes in Computer Science 2250, 2001, pp.517–530.

  14. Brauburger J, Giesl J. Termination analysis for partial functions. In Proc. the Third International Static Analysis Symposium (SAS'96), Aachen, Germany, Lecture Notes in Computer Science 1145, 1996, pp.113–127.

  15. Giesl J. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 1997, 19: 1–29.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Beijing Normal University, Beijing, 100875, P.R. China

    Su Feng

Authors
  1. Su Feng
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Su Feng.

Additional information

This work is supported partially by the National Natural Science Foundation of China under Grant No.60273015 and the Scientific Research Foundation for Returned Overseas Chinese Scholars, Ministry of Education of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feng, S. Mechanizing Weakly Ground Termination Proving of Term Rewriting Systems by Structural and Cover-Set Inductions. J Comput Sci Technol 20, 496–513 (2005). https://doi.org/10.1007/s11390-005-0496-0

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-005-0496-0

Keywords