A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Derivatives of Regular Expressions
Journal of the ACM (JACM)
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Regular-expression derivatives re-examined
Journal of Functional Programming
Certification of Termination Proofs Using CeTA
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A decision procedure for bisimilarity of generalized regular expressions
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Code generation via higher-order rewrite systems
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Automated engineering of relational and algebraic methods in isabelle/hol
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
On probabilistic kleene algebras, automata and simulations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
A formalisation of the Myhill-Nerode theorem based on regular expressions (proof pearl)
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
A decision procedure for regular expression equivalence in type theory
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Automated analysis of regular algebra
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Automated reasoning in higher-order regular algebra
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Deciding regular expressions (in-)equivalence in coq
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
On completeness of omega-regular algebras
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Verified decision procedures for MSO on words based on derivatives of regular expressions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Efficient dynamic access analysis using JavaScript proxies
Proceedings of the 9th symposium on Dynamic languages
Kleene algebra with tests and coq tools for while programs
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
| Hi-index | 0.00 |
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.