Partial derivative automata formalized in Coq
In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the Coq proof assistant. This proof is part of a for- malization of Kleene algebra and regular languages in Coq towards their usage in program certific...
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | conferencePaper |
| Language: | eng |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/13097 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/13097 |