A Toolchain to Produce Verified OCaml Libraries

Jean-Christophe Filliâtre (1, 2) , Léon Gondelman (3) , Cláudio Lourenço (1, 2) , Andrei Paskevich (1, 2) , Mário Pereira (4) , Simão Melo de Sousa (5) , Aymeric Walch (6)

1 LRI - Laboratoire de Recherche en Informatique
2 TOCCATA - Formally Verified Programs, Certified Tools and Numerical Computations
3 Department of Computer Science [Aarhus]
4 NOVA-LINCS - NOVA Laboratory for Computer Science and Informatics
5 UBI - University of Beira Interior [Portugal]
6 ENS de Lyon - École normale supérieure de Lyon

This paper presents a methodology to get correct-by-construction OCaml programs using the Why3 tool. First, a formal behavioral specification is given in the form of an OCaml module signature extended with type invariants and function contracts, in the spirit of JML. Second, an implementation is written in the programming language of Why3 and then verified with respect to the specification. Finally, an OCaml program is obtained by an automated translation. Our methodology is illustrated with the proof of a union-find library. Several other proofs of data structures and algorithms are included in the companion artifact to this paper.

Domaines: Logique en informatique [cs.LO]

Jean-Christophe Filliâtre, Léon Gondelman, Cláudio Lourenço, Andrei Paskevich, Mário Pereira, et al.. A Toolchain to Produce Verified OCaml Libraries. 2020. ⟨hal-01783851v2⟩