论文信息 - Proof Pearl: Regular Expression Equivalence and Relation Algebra

Proof Pearl: Regular Expression Equivalence and Relation Algebra

We describe and verify an elegant equivalence checker for regular expressions. It works by constructing a bisimulation relation between (derivatives of) regular expressions. By mapping regular expressions to binary relations, an automatic and complete proof method for (in)equalities of binary relations over union, composition and (reflexive) transitive closure is obtained. The verification is carried out in the theorem prover Isabelle/HOL, yielding a practically useful decision procedure.

Tobias Nipkow | Alexander Krauss | T. Nipkow | Alexander Krauss

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

[2] Tobias Nipkow,et al. Executing Higher Order Logic , 2000, TYPES.

[3] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.

[4] Alexandra Silva,et al. A Decision Procedure for Bisimilarity of Generalized Regular Expressions , 2010, SBMF.

[5] Tobias Nipkow,et al. Regular Sets and Expressions , 2010, Arch. Formal Proofs.

[6] Dexter Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[7] Damien Pous,et al. An Efficient Coq Tactic for Deciding Kleene Algebras , 2010, ITP.

[8] Robert S. Boyer,et al. Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures. , 1979 .

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

[10] Aaron Turon,et al. Regular-expression derivatives re-examined , 2009, Journal of Functional Programming.

[11] Jan J. M. M. Rutten,et al. Automata and Coinduction (An Exercise in Coalgebra) , 1998, CONCUR.