A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems-Reference-Cited by-同舟云学术

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems

Published:2012-03-28 Issue:1 Volume:8 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Aoto Takahito,Toyama Yoshihito

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference27 articles.

1. T. Aoto. Automated confluence proof by decreasing diagrams based on rule-labelling. In C. Lynch, editor,Proc. of RTA 2010, volume 6 ofLIPIcs, pages 7-16. Schloss Dagstuhl, 2010.

2. T. Aoto and Y. Toyama. A reduction-preserving completion for proving confluence of non-terminating term rewriting systems. In M. Schmidt-Schauß, editor,Proc. of RTA 2011, volume 10 ofLIPIcs, pages 91-106. Schloss Dagstuhl, 2011.

3. T. Aoto, Y. Yoshida, and Y. Toyama. Proving confluence of term rewriting systems automatically. In R. Treinen, editor,Proc. of RTA 2009, volume 5595 ofLNCS, pages 93-102. Springer-Verlag, 2009.

4. F. Baader and T. Nipkow.Term Rewriting and All That. Cambridge University Press, 1998.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compositional Confluence Criteria;Logical Methods in Computer Science;2024-01-23

2. Term Evaluation Systems with Refinements: First-Order, Second-Order, and Contextual Improvement;Lecture Notes in Computer Science;2024

3. A Formalization of the Development Closedness Criterion for Left-Linear Term Rewrite Systems;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11

4. An Extensionally Equivalence-ensured Language for Task Parallel Processing with Backtracking-based Load Balancing;Journal of Information Processing;2021

5. CSI: New Evidence – A Progress Report;Automated Deduction – CADE 26;2017