Advertisement

From Outermost to Context-Sensitive Rewriting

  • Jörg Endrullis
  • Dimitri Hendriks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5595)

Abstract

We define a transformation from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system. For the class of left-linear TRSs the transformation is complete. Thereby state-of-the-art termination methods and automated termination provers for context-sensitive rewriting become available for proving termination of outermost rewriting. The translation has been implemented in Jambox, making it the most successful tool in the category of outermost rewriting of the last edition of the annual termination competition.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alarcón, B., Emmes, F., Fuhs, C., Giesl, J., Gutiérrez, R., Lucas, S., Schneider-Kamp, P., Thiemann, R.: Improving Context-Sensitive Dependency Pairs. In: LPAR 2008. LNCS, vol. 5330, pp. 636–651. Springer, Heidelberg (2008)Google Scholar
  2. 2.
    Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133–178 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http://www.grappa.univ-lille3.fr/tata
  4. 4.
    Endrullis, J., Waldmann, J., Zantema, H.: Matrix Interpretations for Proving Termination of Term Rewriting. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 574–588. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Fissore, O., Gnaedig, I., Kirchner, H.: Cariboo, a Termination Proof Tool for Rewriting-Based Programming Languages with Strategies, Version 1.0 (2004)Google Scholar
  6. 6.
    Lucas, S.: Context-Sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming 1998(1) (1998)Google Scholar
  7. 7.
    Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, New York (2002)CrossRefzbMATHGoogle Scholar
  8. 8.
    Raffelsieper, M., Zantema, H.: A Transformational Approach to Prove Outermost Termination Automatically. ENTCS 237, 3–21 (2009)zbMATHGoogle Scholar
  9. 9.
    Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)Google Scholar
  10. 10.
    Termination Competition, http://www.termination-portal.org/
  11. 11.
    Thiemann, R.: From Outermost Termination to Innermost Termination. In: SOFSEM 2009, pp. 533–545 (2009)Google Scholar
  12. 12.
    Zantema, H.: Termination of Term Rewriting by Semantic Labelling. Fundamenta Informaticae 24, 89–105 (1995)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jörg Endrullis
    • 1
  • Dimitri Hendriks
    • 1
  1. 1.Vrije Universiteit AmsterdamThe Netherlands

Personalised recommendations