Embedding Untrusted Imperative ML Oracles into Coq Verified Code

Sylvain Boulmé (1) , Thomas Vandendorpe (1)

1 VERIMAG - IMAG - VERIMAG

This paper investigates a lightweight approach-combining Coq and OCaml typecheckers-in order to formally verify higher-order imperative programs in partial correctness. In this approach, the user does never formally reason about effects of imperative functions, but only about their results. Formal guarantees are obtained by combining parametric reasoning over polymorphic functions (i.e. "theorems for free" a la Wadler) with verified defensive programming. This paper illustrates the approach on several examples. Among them: first, the certification of a polymorphic memoized fixpoint operator using untrusted hash-tables; second, a certified Boolean SAT-solver, invoking internally any untrusted but state-of-the-art SAT-solver (itself generally programmed in C/C++).

Mots clés: Polymorphism; The Coq Proof Assistant; Parametricity; Monads

Domaines: Génie logiciel [cs.SE]; Langage de programmation [cs.PL]; Logique en informatique [cs.LO]

Sylvain Boulmé, Thomas Vandendorpe. Embedding Untrusted Imperative ML Oracles into Coq Verified Code. 2019. ⟨hal-02062288v2⟩