A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL-Reference-Cited by-同舟云学术

A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019
language:
Short-container-title:

Author:

Felgenhauer Bertram¹,Middeldorp Aart¹,Prathamesh T. V. H.¹,Rapp Franziska²

Affiliation:

1. University of Innsbruck, Austria

2. Allgemeines Rechenzentrum Innsbruck, Austria

Publisher

ACM Press

Reference23 articles.

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

2. S. Berghofer, L. Bulwahn, and F. Haftmann. 2009. Turning Inductive into Equational Specifications. In Proc. 22nd TPHOLs (LNCS), Vol. 5674. 131–146.

3. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. 2008. Tree Automata Techniques and Applications. http://www.grappa.univ-lille3.fr/tata

4. H. Comon, G. Godoy, and R. Nieuwenhuis. 2001. The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. In Proc. 42nd FOCS. 298–307.

5. M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. 1990. Decidability of the Confluence of Finite Ground Term Rewriting Systems and of Other Related Term Rewriting Systems. I&C 88, 2 (1990), 187–201.

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

1. First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification;Journal of Automated Reasoning;2023-04-06

2. A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems;Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs;2021-01-17

3. Certifying Proofs in the First-Order Theory of Rewriting;Tools and Algorithms for the Construction and Analysis of Systems;2021

4. Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting;Tools and Algorithms for the Construction and Analysis of Systems;2020