Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Reducing Right-Hand Sides for Termination

  • Chapter
Processes, Terms and Cycles: Steps on the Road to Infinity

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3838))

Abstract

We propose two transformations on term rewrite systems (TRSs) based on reducing right-hand sides: one related to the transformation order and a variant of dummy elimination. Under mild conditions we prove that the transformed system is terminating if and only if the original one is terminating. Both transformations are very easy to implement, and make it much easier to prove termination of some TRSs automatically.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  3. Bellegarde, F., Lescanne, P.: Termination by completion. Applicable Algebra in Engineering, Communication and Computing 1(2), 79–96 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ben-Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming 9, 137–159 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science 17, 279–301 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  6. Giesl, J., et al.: AProVE: Automated program verification environment., http://aprove.informatik.rwth-aachen.de/

  7. Ferreira, M.: Termination of Term Rewriting – Well-Foundedness, Totality, and Transformations. PhD thesis, University of Utrecht (1995)

    Google Scholar 

  8. Ferreira, M., Zantema, H.: Dummy elimination: Making termination easier. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 243–252. Springer, Heidelberg (1995)

    Google Scholar 

  9. Ferreira, M.C.F.: Dummy elimination in equational rewriting. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 63–77. Springer, Heidelberg (1996)

    Google Scholar 

  10. Giesl, J., Middeldorp, A.: Eliminating dummy elimination. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 309–323. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol. 3452, pp. 301–331. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Gramlich, B.: Simplifying termination proofs for rewrite systems by preprocessing. In: Gabrielli, M., Pfenning, F. (eds.) Proceedings of the 2nd International Conference on Principles and Practice of Declarative Programming (PPDP), Montreal, Canada, September 2000, pp. 139–150. ACM Press, New York (2000)

    Chapter  Google Scholar 

  13. Hirokawa, N., Middeldorp, A.: TTT: Tyrolean termination tool, http://cl2-informatik.uibk.ac.at/ttt/

  14. Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 249–268. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Koprowski, A.: TPA: Termination proved automatically, http://www.win.tue.nl/tpa

  16. Middeldorp, A., Ohsaki, H., Zantema, H.: Transforming termination by self-labelling. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol. 1104, pp. 373–386. Springer, Heidelberg (1996)

    Google Scholar 

  17. Steinbach, J.: Automatic termination proofs with transformation orderings. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 11–25. Springer, Heidelberg (1995)

    Google Scholar 

  18. Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  19. Thiemann, R., Zantema, H., Giesl, J., Schneider-Kamp, P.: Adding constants to string rewriting. Technical report, RWTH Aachen (2005), To appear, available via, http://www-i2.informatik.rwth-aachen.de/AProVE/ConstantsSRS.pdf

  20. TPDB. Termination problem data base, http://www.lri.fr/~marche/tpdb/

  21. Zantema, H.: TORPA: Termination of rewriting proved automatically, http://www.win.tue.nl/~hzantema/torpa.html

  22. Zantema, H.: Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation 17, 23–50 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  23. Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24, 89–105 (1995)

    MATH  MathSciNet  Google Scholar 

  24. Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181–259. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  25. Zantema, H.: Termination of string rewriting proved automatically. Technical Report CS-report 03-14, Eindhoven University of Technology (2003), Available via, http://www.win.tue.nl/inf/onderzoek/en_index.html

  26. Zantema, H.: TORPA: termination of rewriting proved automatically. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 95–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  27. Zantema, H.: Termination of string rewriting proved automatically. Journal of Automated Reasoning (2005) (Accepted for publication)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Hans Zantema

Authors
  1. Hans Zantema
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, Austria

    Aart Middeldorp

  2. Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS, Utrecht, The Netherlands

    Vincent van Oostrom

  3. Department of Theoretical Computer Science, Vrije Universiteit, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Femke van Raamsdonk

  4. VU Vrije Universiteit Amsterdam,  

    Roel de Vrijer

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Zantema, H. (2005). Reducing Right-Hand Sides for Termination. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds) Processes, Terms and Cycles: Steps on the Road to Infinity. Lecture Notes in Computer Science, vol 3838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601548_12

Download citation

  • DOI: https://doi.org/10.1007/11601548_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation