Certifying Proofs in the First-Order Theory of Rewriting

The first-order theory of rewriting is a decidable theory for linear variable-separated rewrite systems. The decision procedure is based on tree automata techniques and recently we completed a formalization in the Isabelle proof assistant. In this paper we present a certificate language that enables the output of software tools implementing the decision procedure to be formally verified. To show the feasibility of this approach, we present FORT-h, a reincarnation of the decision tool FORT with certifiable output, and the formally verified certifier FORTify.

[1]  Nils Klarlund,et al.  MONA Implementation Secrets , 2000, Int. J. Found. Comput. Sci..

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

[3]  René Thiemann,et al.  Deriving class instances for datatypes , 2015, Arch. Formal Proofs.

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

[5]  Andreas Lochbihler,et al.  Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable , 2013, ITP.

[6]  Lukás Holík,et al.  Antiprenexing for WSkS: A Little Goes a Long Way , 2020, LPAR.

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

[8]  Stefan Berghofer.  First-Order Logic According to Fitting , 2007, Arch. Formal Proofs.

[9]  Yoshihito Toyama,et al.  Proving Confluence of Term Rewriting Systems Automatically , 2009, RTA.

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

[11]  Nao Hirokawa,et al.  CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems , 2015, CADE.

[12]  Albert Rubio,et al.  The Termination and Complexity Competition , 2019, TACAS.

[13]  Bertram Felgenhauer,et al.  A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems , 2021, CPP.

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

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

[16]  de Ng Dick Bruijn,et al.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[17]  Julian Nagele,et al.  Confluence Competition 2019 , 2019, TACAS.

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