Producing All Ideals of a Forest, Formally (Verification Pearl) - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Producing All Ideals of a Forest, Formally (Verification Pearl)

Résumé

In this paper we present the first formal proof of an implementation of Koda and Ruskey's algorithm, an algorithm for generating all ideals of a forest poset as a Gray code. One contribution of this work is to exhibit the invariants of this algorithm, which proved to be challenging. We implemented, specified, and proved this algorithm using the Why3 tool. This allowed us to employ a combination of several automated theorem provers to discharge most of the verification conditions, and the Coq proof assistant for the remaining two.
Fichier principal
Vignette du fichier
paper_6.pdf (373.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01316859 , version 1 (17-05-2016)
hal-01316859 , version 2 (29-11-2016)

Identifiants

Citer

Jean-Christophe Filliâtre, Mário Pereira. Producing All Ideals of a Forest, Formally (Verification Pearl). VSTTE 2016, Jul 2016, Toronto, Canada. pp.46 - 55, ⟨10.1007/978-3-319-48869-1_4⟩. ⟨hal-01316859v2⟩
322 Consultations
252 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More