Skip to main content
SpringerLink
Log in

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs

  • Conference paper
Functional and Constraint Logic Programming (WFLP 2011)

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

Included in the following conference series:

Abstract

In this paper, we propose methods for proving termination of constrained term rewriting systems, where constraints are interpreted by built-in semantics given by users, and rewrite rules are assumed to be sound for the interpretation. To this end, we extend the dependency pair framework for proving termination of unconstrained term rewriting systems to constrained term rewriting systems. Moreover, we extend the dependency pair framework so that dependency pair processors take a subgraph of the dependency graph as input and they output a finite set of graphs which can be obtained by eliminating nodes and/or edges from the input graph.

This work is partialy supported by MEXT KAKENHI #20300010 and # 21700011.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Armando, A., Rusinowitch, M., Stratulat, S.: Incorporating decision procedures in implicit induction. J. Symb. Comput. 34(4), 241–258 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comput. Sci. 236(1-2), 133–178 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  4. Borralleras, C., Rubio, A.: Orderings and constraints: Theory and practice of proving termination. In: Comon-Lundh, H., Kirchner, C., Kirchner, H. (eds.) Jouannaud Festschrift. LNCS, vol. 4600, pp. 28–43. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning 14(2), 189–235 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bouhoula, A., Jacquemard, F.: Automated induction for complex data structures. In: CoRR, abs/0811.4720 (2008)

    Google Scholar 

  7. Bouhoula, A., Jacquemard, F.: Automated induction with constrained tree automata. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 539–554. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Comon, H.: Completion of rewrite systems with membership constraints. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 392–403. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  9. Comon, H.: Completion of rewrite systems with membership constraints. part I: Deduction rules. J. Symb. Comput. 25(4), 397–419 (1998)

    Article  MATH  Google Scholar 

  10. Comon, H.: Completion of rewrite systems with membership constraints. part II: Constraint solving. J. Symb. Comput. 25(4), 421–453 (1998)

    Article  MATH  Google Scholar 

  11. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata (release October 12, 2007)

  12. Falke, S., Kapur, D.: Inductive decidability using implicit induction. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 45–59. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Falke, S., Kapur, D.: Dependency pairs for rewriting with built-in numbers and semantic data structures. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 94–109. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Falke, S., Kapur, D.: A term rewriting approach to the automated termination analysis of imperative programs. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 277–293. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 110–125. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Fuhs, C., Giesl, J., Plücker, M., Schneider-Kamp, P., Falke, S.: Proving termination of integer term rewriting. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 32–47. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  17. Furuichi, Y., Nishida, N., Sakai, M., Kusakari, K., Sakabe, T.: Approach to procedural-program verification based on implicit induction of constrained term rewriting systems. IPSJ Trans. on Prog. 1(2), 100–121 (2008) (in Japanese)

    Google Scholar 

  18. Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281–286. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. 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 (LNAI), vol. 3452, pp. 301–331. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Giesl, J., Thiemann, R., Swiderski, S., Schneider-Kamp, P.: Proving termination by bounded increase. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 443–459. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  21. Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 32–46. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  22. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Inf. Comput. 205(4), 474–511 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  23. Hoot, C.: Completion for constrained term rewriting systems. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol. 656, pp. 408–423. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  24. Huth, M., Ryan, M.: Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  25. Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 47–61. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  26. Lynch, C., Snyder, W.: Redundancy criteria for constrained completion. Theor. Comput. Sci. 142(2), 141–177 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  27. Nishida, N., Sakai, M., Hattori, T.: On Disproving Termination of Constrained Term Rewriting Systems. In: Proc. of WST 2010, 5 pages (2010)

    Google Scholar 

  28. Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  29. Sakata, T., Nishida, N., Sakabe, T.: On proving termination of constrained term rewriting systems by eliminating edges from dependency graphs. The Full Version of this Paper, http://www.trs.cm.is.nagoya-u.ac.jp/~nishida/wflp11/

  30. Sakata, T., Nishida, N., Sakabe, T., Sakai, M., Kusakari, K.: Rewriting induction for constrained term rewriting systems. IPSJ Trans. on Prog. 2(2), 80–96 (2009) (in Japanese)

    Google Scholar 

  31. Thieman, R.: The DP Framework for Proving Termination of Term Rewriting. PhD thesis, RWTH Aachen University, Germany (October 2007)

    Google Scholar 

  32. Toyama, Y.: Confluent term rewriting systems with membership conditions. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 228–241. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  33. Yamada, J.: Confluence of terminating membership conditional TRS. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol. 656, pp. 378–392. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, 464-8603, Japan

    Tsubasa Sakata, Naoki Nishida & Toshiki Sakabe

Authors
  1. Tsubasa Sakata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naoki Nishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshiki Sakabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Wirtschaftsinformatik, Westfälische Wilhelms-Universität Münster, Leonardo-Campus 3, D-48149, Münster, Germany

    Herbert Kuchen

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakata, T., Nishida, N., Sakabe, T. (2011). On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. In: Kuchen, H. (eds) Functional and Constraint Logic Programming. WFLP 2011. Lecture Notes in Computer Science, vol 6816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22531-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22531-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22530-7

  • Online ISBN: 978-3-642-22531-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation