A Decision Procedure for Regular Expression Equivalence in Type Theory
Paper i proceeding, 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.

Författare

Thierry Coquand

Göteborgs universitet

Vincent Siles

Göteborgs universitet

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 7086 119-134

Ämneskategorier

Data- och informationsvetenskap

DOI

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

ISBN

978-3-642-25379-9

Mer information

Skapat

2017-10-10