CoCo 2019: report on the eighth confluence competition-Reference-Cited by-同舟云学术

CoCo 2019: report on the eighth confluence competition

Published:2021-05-28 Issue:6 Volume:23 Page:905-916
ISSN:1433-2779
Container-title:International Journal on Software Tools for Technology Transfer
language:en
Short-container-title:Int J Softw Tools Technol Transfer

Author:

Middeldorp Aart,Nagele Julian,Shintani Kiraku

Abstract

AbstractWe report on the 2019 edition of the Confluence Competition, a competition of software tools that aim to prove or disprove confluence and related (undecidable) properties of rewrite systems automatically.

Funder

University of Innsbruck and Medical University of Innsbruck

Publisher

Springer Science and Business Media LLC

Subject

Information Systems,Software

Link

https://link.springer.com/content/pdf/10.1007/s10009-021-00620-4.pdf

Reference48 articles.

1. Aoto, T.: Automated confluence proof by decreasing diagrams based on rule-labelling. In: Proceedings of 21st International Conference on Rewriting Techniques and Applications, LIPIcs, vol. 6, pp. 7–16 (2010). https://doi.org/10.4230/LIPIcs.RTA.2010.7

2. Aoto, T., Toyama, Y.: Ground confluence prover based on rewriting induction. In: Proceedings of 1st International Conference on Formal Structures for Computation and Deduction, LIPIcs, vol. 52, pp. 33:1–33:12 (2016). https://doi.org/10.4230/LIPIcs.FSCD.2016.33

3. Aoto, T., Toyama, Y.: Automated proofs of unique normal forms with respect to conversion for term rewriting systems. In: Proceedings of 12th International Symposium on Frontiers of Combining Systems, LNCS, vol. 11715 (2019). https://doi.org/10.1007/978-3-030-29007-8_19

4. Aoto, T., Toyama, Y., Kimura, Y.: Improving rewriting induction approach for proving ground confluence. In: Proceedings of 2nd International Conference on Formal Structures for Computation and Deduction, LIPIcs, vol. 84, pp. 7:1–7:18 (2017). https://doi.org/10.4230/LIPIcs.FSCD.2017.7

5. Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Proceedings of 20th International Conference on Rewriting Techniques and Applications, LNCS, vol. 5595, pp. 93–102 (2009). https://doi.org/10.1007/978-3-642-02348-4_7

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

1. Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

2. 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

3. Proving and disproving confluence of context-sensitive rewriting;Journal of Logical and Algebraic Methods in Programming;2022-04

4. Term Orderings for Non-reachability of (Conditional) Rewriting;Automated Reasoning;2022

5. TOOLympics II: competitions on formal methods;International Journal on Software Tools for Technology Transfer;2021-06-18