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.Fundação para a Ciência e Tecnologia (FCT) Program POSI, RESCUE (PTDC/EIA/65862/2006), SFRH/BD/33233/2007
Cette thèse décrit trois travaux de formalisation en Coq. Le premier chapitre s'intéresse à l'implém...
Abstract. In an earlier paper, the author used derivatives to construct a deterministic automaton re...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...
In this paper we present a computer assisted proof of the correctness of a partial derivative automa...
This paper presents a mechanically verified implementation of an algorithm for deciding the equivale...
This paper presents a mechanically verified implementation of an algorithm for deciding the equival...
International audienceWe present a reflexive tactic for deciding the equational theory of Kleene alg...
A method for constructing a finite automaton by taking derivatives of a regular set is a method for ...
16+3 pagesInternational audienceWe present a Coq library about Kleene algebra with tests, including ...
AbstractLet E be a regular expression. Our aim is to establish a theoretical relation between two we...
International audienceWe explore the theory of regular language representations in the constructive ...
The use of derivatives for efficiently deciding equivalence and membership in regular languages has ...
This thesis describe three formalisations in Coq. The first chapter is devoted to the implementation...
AbstractThe main theorem allows an elegant algorithm to be refined into an efficient one. The elegan...
AbstractWe introduce a notion of partial derivative of a regular expression and apply it to finite a...
Cette thèse décrit trois travaux de formalisation en Coq. Le premier chapitre s'intéresse à l'implém...
Abstract. In an earlier paper, the author used derivatives to construct a deterministic automaton re...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...
In this paper we present a computer assisted proof of the correctness of a partial derivative automa...
This paper presents a mechanically verified implementation of an algorithm for deciding the equivale...
This paper presents a mechanically verified implementation of an algorithm for deciding the equival...
International audienceWe present a reflexive tactic for deciding the equational theory of Kleene alg...
A method for constructing a finite automaton by taking derivatives of a regular set is a method for ...
16+3 pagesInternational audienceWe present a Coq library about Kleene algebra with tests, including ...
AbstractLet E be a regular expression. Our aim is to establish a theoretical relation between two we...
International audienceWe explore the theory of regular language representations in the constructive ...
The use of derivatives for efficiently deciding equivalence and membership in regular languages has ...
This thesis describe three formalisations in Coq. The first chapter is devoted to the implementation...
AbstractThe main theorem allows an elegant algorithm to be refined into an efficient one. The elegan...
AbstractWe introduce a notion of partial derivative of a regular expression and apply it to finite a...
Cette thèse décrit trois travaux de formalisation en Coq. Le premier chapitre s'intéresse à l'implém...
Abstract. In an earlier paper, the author used derivatives to construct a deterministic automaton re...
This is a library of constructions on regular expressions and lan-guages. It provides the operations...