Abstract (EN):
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. Tins proof is part of a formalization of Kleene algebra and regular languages in Coq towards their usage in program certification.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica
Contacto:
jba@di.uminho.pt; nam@ncc.up.pt; dpereira@ncc.up.pt; desousa@di.ubi.pt
Nº de páginas:
10