Advertisement

Abstract

Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has not been investigated in connection with proofs of termination of CSR. In this paper, we show how to use dependency pairs in proofs of termination of CSR. The implementation and practical use of the developed techniques yield a novel and powerful framework which improves the current state-of-the-art of methods for proving termination of CSR.

Keywords

Dependency pairs term rewriting program analysis termination 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AG00]
    Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133–178 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  2. [AGIL07]
    Alarcón, B., Gutiérrez, R., Iborra, J., Lucas, S.: Proving Termination of Context-Sensitive Rewriting with MU-TERM. Electronic Notes in Theoretical Computer Science (to appear, 2007)Google Scholar
  3. [BLR02]
    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. [DLMMU06]
    Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation (to appear, 2006)Google Scholar
  5. [GAO02]
    Giesl, J., Arts, T., Ohlebusch, E.: Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation 34(1), 21–58 (2002)CrossRefMathSciNetGoogle Scholar
  6. [GL02]
    Gramlich, B., Lucas, S.: Simple termination of context-sensitive rewriting. In: Proc. of RULE 2002, pp. 29–41. ACM Press, New York (2002)CrossRefGoogle Scholar
  7. [GM99]
    Giesl, J., Middeldorp, A.: Transforming Context-Sensitive Rewrite Systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 271–285. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  8. [GM04]
    Giesl, J., Middeldorp, A.: Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming 14(4), 379–427 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  9. [GTS04]
    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)CrossRefGoogle Scholar
  10. [HM04]
    Hirokawa, N., Middeldorp, A.: Dependency Pairs Revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 249–268. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. [HM05]
    Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Information and Computation 199, 172–199 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  12. [Luc98]
    Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998(1), 1–61 (1998)Google Scholar
  13. [Luc02]
    Lucas, S.: Context-sensitive rewriting strategies. Information and Computation 178(1), 293–343 (2002)MathSciNetGoogle Scholar
  14. [Luc04a]
    Lucas, S.: MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 200–209. Springer, Heidelberg (2004), Available at: http://www.dsic.upv.es/~slucas/csr/termination/muterm CrossRefGoogle Scholar
  15. [Luc04b]
    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)CrossRefGoogle Scholar
  16. [Luc05]
    Lucas, S.: Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications 39(3), 547–586 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  17. [Luc06]
    Lucas, S.: Proving termination of context-sensitive rewriting by transformation. Information and Computation (to appear, 2006)Google Scholar
  18. [Ohl02]
    Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Berlin (2002)zbMATHGoogle Scholar
  19. [Ter03]
    TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)Google Scholar
  20. [Zan97]
    Zantema, H.: Termination of Context-Sensitive Rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 172–186. Springer, Heidelberg (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Beatriz Alarcón
    • 1
  • Raúl Gutiérrez
    • 1
  • Salvador Lucas
    • 1
  1. 1.DSICUniversidad Politécnica de ValenciaSpain

Personalised recommendations