Skip to main content
SpringerLink
Log in

mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting

  • Conference paper
Rewriting Techniques and Applications (RTA 2004)

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

Included in the following conference series:

Abstract

Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Context-sensitive rewriting (CSR) is an example of such a restriction. In CSR, the replacements in some arguments of the function symbols are permanently forbidden. This paper describes mu-term, a tool which can be used to automatically prove termination of CSR. The tool implements the generation of the appropriate orderings for proving termination of CSR by means of polynomial interpretations over the rational numbers. In fact, mu-term is the first termination tool which generates term orderings based on such polynomial interpretations. These orderings can also be used, in a number of different ways, for proving termination of ordinary rewriting. Proofs of termination of CSR are also possible via existing transformations to TRSs (without any replacement restriction) which are also implemented in mu-term.

Work partially supported by MCYT project STREAM TIC2001-2705-C03-01, MCyT Acción Integrada HU 2003-0003 and Agencia Valenciana de Ciencia y Tecnología GR03/025.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical report, AIB-2001-09, RWTH Aachen, Germany (2001)

    Google Scholar 

  3. Borralleras, C., Lucas, S., Rubio, A.: Recursive Path Orderings can be Context- Sensitive. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 314–331. Springer, Heidelberg (2002)

    Google Scholar 

  4. Borralleras, C.: Ordering-based methods for proving termination automatically. PhD Thesis, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya (May 2003)

    Google Scholar 

  5. Ferreira, M.C.F., Ribeiro, A.L.: Context-sensitive AC-rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 286–300. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Gramlich, B., Lucas, S.: Modular termination of context-sensitive rewriting. In: Proc. of PPDP 2002, pp. 50–61. ACM Press, New York (2002)

    Chapter  Google Scholar 

  7. Gramlich, B., Lucas, S.: Simple termination of context-sensitive rewriting. In: Proc. of RULE 2002, pp. 29–41. ACM Press, New York (2002)

    Chapter  Google Scholar 

  8. Giesl, J., Middeldorp, A.: Termination of Innermost Context-Sensitive Rewriting. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 231–244. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Giesl, J., Middeldorp, A.: Transformation Techniques for Context-Sensitive Rewrite Systems. In: Journal of Functional Programming (2004) (to appear)

    Google Scholar 

  10. Lucas, S.: Termination of context-sensitive rewriting by rewriting. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 122–133. Springer, Heidelberg (1996)

    Google Scholar 

  11. Lucas, S.: Termination of Rewriting With Strategy Annotations. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 669–684. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Lucas, S.: Context-sensitive rewriting strategies. Information and Computation 178(1), 293–343 (2002)

    MathSciNet  Google Scholar 

  13. Lucas, S.: Lazy Rewriting and Context-Sensitive Rewriting. Electronic Notes in Theoretical Computer Science, vol. 64. Elsevier Sciences, Amsterdam (2002)

    Google Scholar 

  14. Lucas, S.: Polynomials for proving termination of context-sensitive rewriting. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 318–332. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Steinbach, J.: Generating Polynomial Orderings. Information Processing Letters 49, 85–93 (1994)

    Article  MATH  Google Scholar 

  16. Zantema, H.: Termination of Context-Sensitive Rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 172–186. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DSIC, Universidad Politécnica de Valencia, Camino de Vera s/n, E-46022, Valencia, Spain

    Salvador Lucas

Authors
  1. Salvador Lucas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Vincent van Oostrom

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lucas, S. (2004). mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. In: van Oostrom, V. (eds) Rewriting Techniques and Applications. RTA 2004. Lecture Notes in Computer Science, vol 3091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25979-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25979-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22153-1

  • Online ISBN: 978-3-540-25979-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation