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 fully verified interactive theorem prover for higher-order logic, more specifi...
This paper presents our integration of efficient resolution-based theorem provers into the Jahob da...
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampir...
International audienceWe describe the specification and proof of an (imperative, sequential) hash ta...
International audienceWe report on three different approaches to use hash-consing in programs certif...
We provide a framework for separation-logic based correctness proofs of Imperative HOL programs. Our...
AbstractWe formalize higher-order separation logic for a first-order imperative language with proced...
Part of the Computer Sciences Commons This is brought to you for free and open access by the Theses ...
When using a proof assistant to reason in an embedded logic – like separation logic – one cannot ben...
International audienceWe report on four different approaches to implementing hash-consing in Coq pro...
Abstract. This paper presents our integration of efficient resolutionbased theorem provers into the ...
We present the first specification and verification of an implementation of a causally-consistent di...
This preprint has been largely rewritten and integrated into Sylvain Boulm{\'e}'s Habilitation in 20...
See also http://www-verimag.imag.fr/~boulme/hdr.htmlThis document presents a lightweight approach – ...
Abstract. This paper presents the formalisation and correctness proofs of large parts of a hash tabl...
This paper presents a fully verified interactive theorem prover for higher-order logic, more specifi...
This paper presents our integration of efficient resolution-based theorem provers into the Jahob da...
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampir...
International audienceWe describe the specification and proof of an (imperative, sequential) hash ta...
International audienceWe report on three different approaches to use hash-consing in programs certif...
We provide a framework for separation-logic based correctness proofs of Imperative HOL programs. Our...
AbstractWe formalize higher-order separation logic for a first-order imperative language with proced...
Part of the Computer Sciences Commons This is brought to you for free and open access by the Theses ...
When using a proof assistant to reason in an embedded logic – like separation logic – one cannot ben...
International audienceWe report on four different approaches to implementing hash-consing in Coq pro...
Abstract. This paper presents our integration of efficient resolutionbased theorem provers into the ...
We present the first specification and verification of an implementation of a causally-consistent di...
This preprint has been largely rewritten and integrated into Sylvain Boulm{\'e}'s Habilitation in 20...
See also http://www-verimag.imag.fr/~boulme/hdr.htmlThis document presents a lightweight approach – ...
Abstract. This paper presents the formalisation and correctness proofs of large parts of a hash tabl...
This paper presents a fully verified interactive theorem prover for higher-order logic, more specifi...
This paper presents our integration of efficient resolution-based theorem provers into the Jahob da...
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampir...