Article

On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs

Authors:

Tsubasa Sakata,

Toshiki SakabeAuthors Info & Claims

WFLP'11: Proceedings of the 20th international conference on Functional and constraint logic programming

Pages 138 - 155

Published: 19 July 2011 Publication History

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.

References

[1]

Armando, A., Rusinowitch, M., Stratulat, S.: Incorporating decision procedures in implicit induction. J. Symb. Comput. 34(4), 241-258 (2002).

Digital Library

[2]

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

Digital Library

[3]

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

Digital Library

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

Digital Library

[5]

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

[6]

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

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

Digital Library

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

Digital Library

[9]

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

Digital Library

[10]

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

Digital Library

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

Digital Library

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

Digital Library

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

Digital Library

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

Digital Library

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

Digital Library

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

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

Digital Library

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

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

Digital Library

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

[22]

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

Digital Library

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

Digital Library

[24]

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

Digital Library

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

Digital Library

[26]

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

Digital Library

[27]

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

[28]

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

Digital Library

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

[31]

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

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

Digital Library

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

Digital Library

Cited By

Fuhs CKop CNishida N(2017)Verifying Procedural Programs via Constrained Rewriting InductionACM Transactions on Computational Logic10.1145/306014318:2(1-50)Online publication date: 2-Jun-2017
https://dl.acm.org/doi/10.1145/3060143
Nagao TNishida NCheney JVidal G(2016)Proving inductive validity of constrained inequalitiesProceedings of the 18th International Symposium on Principles and Practice of Declarative Programming10.1145/2967973.2968598(50-61)Online publication date: 5-Sep-2016
https://dl.acm.org/doi/10.1145/2967973.2968598

On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

Proving termination of (conditional) rewrite systems

In this paper an important problem in the domain of term rewriting, the termination of (conditional) rewrite systems, is dealt with. We show that in many applications, well-founded orderings on terms which only make use of syntactic information of a ...
Proving termination properties with MU-TERM
AMAST'10: Proceedings of the 13th international conference on Algebraic methodology and software technology

MU-TERM is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost rewriting, termination of order-sorted rewriting, termination of context-...
Termination of non-simple rewrite systems

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

WFLP'11: Proceedings of the 20th international conference on Functional and constraint logic programming

July 2011

155 pages

ISBN:9783642225307

Editor:
Herbert Kuchen
Westfälische Wilhelms-Universität Münster, Institut für Wirtschaftsinformatik, Münster, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 19 July 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fuhs CKop CNishida N(2017)Verifying Procedural Programs via Constrained Rewriting InductionACM Transactions on Computational Logic10.1145/306014318:2(1-50)Online publication date: 2-Jun-2017
https://dl.acm.org/doi/10.1145/3060143
Nagao TNishida NCheney JVidal G(2016)Proving inductive validity of constrained inequalitiesProceedings of the 18th International Symposium on Principles and Practice of Declarative Programming10.1145/2967973.2968598(50-61)Online publication date: 5-Sep-2016
https://dl.acm.org/doi/10.1145/2967973.2968598

View Options

View options

Media

Figures

Other

Tables

View Table of Contents