A Decision Procedure for Regular Expression Equivalence in Type Theory
Paper in proceedings, 2011

We describe and formally verify a procedure to decide regular expressions equivalence: two regular expressions are equivalent if and only if they recognize the same language. Our approach to this problem is inspired by Brzozowski’s algorithm using derivatives of regular expressions, with a new definition of finite sets. In this paper, we detail a complete formalization of Brzozowki’s derivatives, a new definition of finite sets along with its basic meta-theory, and a decidable equivalence procedure correctly proved using Coq and Ssreflect.

Author

Thierry Coquand

University of Gothenburg

Vincent Siles

University of Gothenburg

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 7086 119-134

Subject Categories

Computer and Information Science

DOI

10.1007/978-3-642-25379-9_11

ISBN

978-3-642-25379-9

More information

Created

10/10/2017