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

It is well known that (ground) confluence is a decidable property of ground term rewrite systems, and that this extends to larger classes. Here we present a formally verified ground confluence checker for linear, variable-separated rewrite systems. To this end, we formalize procedures for ground tree transducers and so-called RRn relations. The ground confluence checker is an important milestone on the way to formalizing the decidability of the first-order theory of ground rewriting for linear, variable-separated rewrite systems. It forms the basis for a formalized confluence checker for left-linear, right-ground systems.

[1]  Bertram Felgenhauer.  Deciding Confluence of Ground Term Rewrite Systems in Cubic Time , 2012, RTA.

[2]  Stefan Berghofer,et al.  Turning Inductive into Equational Specifications , 2009, TPHOLs.

[3]  Bertram Felgenhauer,et al.  A Haskell Library for Term Rewriting , 2013, ArXiv.

[4]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[5]  René Thiemann,et al.  Certification of Termination Proofs Using CeTA , 2009, TPHOLs.

[6]  Tobias Nipkow,et al.  Code Generation via Higher-Order Rewrite Systems , 2010, FLOPS.

[7]  Robert Nieuwenhuis,et al.  The confluence of ground term rewrite systems is decidable in polynomial time , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[8]  Michio Oyamaguchi,et al.  The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable , 1987, Theor. Comput. Sci..

[9]  Yoshihito Toyama,et al.  On the Church-Rosser property for the direct sum of term rewriting systems , 1984, JACM.

[10]  Sophie Tison,et al.  Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems , 1990, Inf. Comput..

[11]  Lukasz Kaiser.  Confluence of Right Ground Term Rewriting Systems Is Decidable , 2005, FoSSaCS.

[12]  Peter Lammich,et al.  Automatic Data Refinement , 2013, ITP.

[13]  Ashish Tiwari,et al.  Confluence of Shallow Right-Linear Rewrite Systems , 2005, CSL.

[15]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[16]  Ashish Tiwari,et al.  Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems , 2004, Applicable Algebra in Engineering, Communication and Computing.

[17]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[18]  Aart Middeldorp,et al.  Fort 2.0 , 2018, IJCAR.

[19]  Bertram Felgenhauer,et al.  Layer Systems for Confluence - Formalized , 2018, ICTAC.

[20]  Sophie Tison,et al.  Decidability of the Confluence of Ground Term Rewriting Systems , 1985, LICS.