Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs-Reference-Cited by-同舟云学术

Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs

Published:2024-01-09 Issue: Volume: Page:147-161
ISSN:
Container-title:Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Hirokawa Nao¹,Kim Dohan²,Shintani Kiraku¹,Thiemann René²

Affiliation:

1. JAIST, Nomi, Japan

2. University of Innsbruck, Innsbruck, Austria

Funder

Austrian Science Fund (FWF)

Japan Society for the Promotion of Science (JSPS) KAKENHI

Japan Society for the Promotion of Science and Austrian Science Fund JSPS-FWF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3636501.3636949

Reference32 articles.

1. Proving Confluence of Term Rewriting Systems Automatically

2. Franz Baader and Tobias Nipkow . 1998. Term rewriting and all that . Cambridge University Press . isbn:978-0-521-45520-6 Franz Baader and Tobias Nipkow. 1998. Term rewriting and all that. Cambridge University Press. isbn:978-0-521-45520-6

3. Z3: An Efficient SMT Solver

4. Confluence of left-linear higher-order rewrite theories by checking their nested critical pairs

5. Bernhard Gramlich. 1995. Confluence without Termination via Parallel Critical Pairs. Fachbereich Informatik Universität Kaiserslautern. Bernhard Gramlich. 1995. Confluence without Termination via Parallel Critical Pairs. Fachbereich Informatik Universität Kaiserslautern.

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

1. Confluence of Logically Constrained Rewrite Systems Revisited;Lecture Notes in Computer Science;2024