论文信息 - A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems

A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems

The first-order theory of rewriting is a decidable theory for finite left-linear right-ground rewrite systems, implemented in FORT. We present a formally verified variant of the decision procedure for the class of linear variable-separated rewrite systems. This variant supports a more expressive theory and is based on the concept of anchored ground tree transducers. The correctness of the decision procedure is verified by a formalization in Isabelle/HOL on top of the Isabelle Formalization of Rewriting (IsaFoR).

[1] Brian Huffman,et al. Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL , 2013, CPP.

[2] Bertram Felgenhauer,et al. A verified ground confluence tool for linear variable-separated rewrite systems in Isabelle/HOL , 2019, CPP.

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

[4] Aart Middeldorp,et al. Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting , 2020, TACAS.

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

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

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

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

[9] Hubert Comon-Lundh. Sequentiality, Monadic Second-Order Logic and Tree Automata , 2000, Inf. Comput..

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