Functors for Proofs and Programs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Functors for Proofs and Programs

Résumé

This paper presents the formal verification with the Coq proof assistant of several applicative data structures implementing finite sets. These implementations are parameterized by an ordered type for the elements, using functors from the ML module system. The verification follows closely this scheme, using the newly Coq module system. One of the verified implementation is the actual code for sets and maps from the Objective Caml standard library. The process of verification exhibited two small errors in the balancing scheme, which have been fixed and then verified. Beyond these verification results, this article illustrates the use and benefits of modules and functors in a logical framework.
Fichier principal
Vignette du fichier
fpp.pdf (257.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00150913 , version 1 (01-06-2007)

Identifiants

Citer

Jean-Christophe Filliâtre, Pierre Letouzey. Functors for Proofs and Programs. 13th European Symposium on Programming, ESOP 2004, Feb 2004, Barcelona, Spain. pp.370-384, ⟨10.1007/b96702⟩. ⟨hal-00150913⟩
208 Consultations
491 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More