Skip to main content
SpringerLink
Log in

TORPA: Termination of Rewriting Proved Automatically

  • 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

The tool TORPA (Termination of Rewriting Proved Automatically) can be used to prove termination of string rewriting systems (SRSs) fully automatically. The underlying techniques include semantic labelling, polynomial interpretations, recursive path order, the dependency pair method and match bounds of right hand sides of forward closures.

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. 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 

  3. Boralleras, C., Rubio, A.: Termptation: termination proof techniques automation, Available at http://www.lsi.upc.es/~albert/

  4. Contejean, E., Marché, C., Monate, B., Urbain, X.: The CiME rewrite tool, Available at http://cime.lri.fr/

  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.: Automated program verification environment (AProVE), Available at http://www-i2.informatik.rwth-aachen.de/AProVE/

  7. Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting. Technical Report 2003-09, National Institute of Aerospace, Hampton, VA (2003) (submitted for publication in a journal)

    Google Scholar 

  8. Giesl, J., Zantema, H.: Liveness in rewriting. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 321–336. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 311–320. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Lankford, D.S.: On proving term rewriting systems are noetherian. Technical report MTP 3, Louisiana Technical University (1979)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

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. 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

Zantema, H. (2004). TORPA: Termination of Rewriting Proved Automatically. 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_7

Download citation

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

  • 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