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...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/13097 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/13097 |
| Resumo: | 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 certification. |
|---|