Add to ORKGInternational audienceWe describe the specification and proof of an (imperative, sequential) hash table implementation. The usual dictionary operations (insertion, lookup, and so on) are supported, as well as iteration via folds and iterators. The code is written in OCaml and verified using higher-order separation logic, embedded in Coq, via the CFML tool and library. This case study is part of a larger project that aims to build a verified OCaml library of basic data structures
This paper presents a methodology to get correct-by-construction OCaml programs using the Why3 tool....
This dissertation presents two pieces of work, one building on the other, that advance the state of ...
International audienceThis article presents the formal verification, using the Coq proof assistant, ...
International audienceWe describe the specification and proof of an (imperative, sequential) hash ta...
We present a new approach for constructing and verifying higher-order, imperative programs using the...
International audienceWe report on four different approaches to implementing hash-consing in Coq pro...
Higher-order functions and imperative references are language features supported by many mainstream ...
This paper presents our integration of efficient resolution-based theorem provers into the Jahob da...
See also http://www-verimag.imag.fr/~boulme/hdr.htmlThis document presents a lightweight approach – ...
AbstractWe formalize higher-order separation logic for a first-order imperative language with proced...
This thesis is about verified computer-aided checking of mathematical proofs. We build on tools for ...
This preprint has been largely rewritten and integrated into Sylvain Boulm{\'e}'s Habilitation in 20...
When using a proof assistant to reason in an embedded logic – like separation logic – one cannot ben...
Recent years have seen a surge in techniques and tools for automatic and semi-automatic static check...
We provide a framework for separation-logic based correctness proofs of Imperative HOL programs. Our...
This paper presents a methodology to get correct-by-construction OCaml programs using the Why3 tool....
This dissertation presents two pieces of work, one building on the other, that advance the state of ...
International audienceThis article presents the formal verification, using the Coq proof assistant, ...
International audienceWe describe the specification and proof of an (imperative, sequential) hash ta...
We present a new approach for constructing and verifying higher-order, imperative programs using the...
International audienceWe report on four different approaches to implementing hash-consing in Coq pro...
Higher-order functions and imperative references are language features supported by many mainstream ...
This paper presents our integration of efficient resolution-based theorem provers into the Jahob da...
See also http://www-verimag.imag.fr/~boulme/hdr.htmlThis document presents a lightweight approach – ...
AbstractWe formalize higher-order separation logic for a first-order imperative language with proced...
This thesis is about verified computer-aided checking of mathematical proofs. We build on tools for ...
This preprint has been largely rewritten and integrated into Sylvain Boulm{\'e}'s Habilitation in 20...
When using a proof assistant to reason in an embedded logic – like separation logic – one cannot ben...
Recent years have seen a surge in techniques and tools for automatic and semi-automatic static check...
We provide a framework for separation-logic based correctness proofs of Imperative HOL programs. Our...
This paper presents a methodology to get correct-by-construction OCaml programs using the Why3 tool....
This dissertation presents two pieces of work, one building on the other, that advance the state of ...
International audienceThis article presents the formal verification, using the Coq proof assistant, ...
