Implementing hash-consed structures in Coq

Abstract : We report on three different approaches to use hash-consing in programs certified with the Coq system, using binary decision diagrams (BDD) as running example. The use cases include execution inside Coq, or execution of the extracted OCaml code. There are different trade-offs between faithful use of pristine extracted code, and code that is fine-tuned to make use of OCaml programming constructs not available in Coq. We discuss the possible consequences in terms of performances and guarantees.
Keywords : Coq OCaml hash-consing BDD
Liste complète des métadonnées

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00816672
Contributor : David Monniaux <>
Submitted on : Monday, April 22, 2013 - 4:43:33 PM
Last modification on : Friday, July 6, 2018 - 10:08:02 AM
Document(s) archivé(s) le : Tuesday, July 23, 2013 - 4:14:07 AM

Files

Braibant_Jourdan_Monniaux_ITP2...
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Braibant, Jacques-Henri Jourdan, David Monniaux. Implementing hash-consed structures in Coq. Interactive Theorem Proving, 4th international conference, Jul 2013, Rennes, France. pp.477-483, ⟨10.1007/978-3-642-39634-2_36⟩. ⟨hal-00816672⟩

Share

Metrics

Record views

523

Files downloads

323