Implementing and reasoning about hash-consed data structures in Coq - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2014

Implementing and reasoning about hash-consed data structures in Coq

Abstract

We report on four different approaches to implementing hash-consing in Coq programs. The use cases include execution inside Coq, or execution of the extracted OCaml code. We explore the 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. We use the running example of binary decision diagrams and then demonstrate the generality of our solutions by applying them to other examples of hash-consed data structures.
Fichier principal
Vignette du fichier
main.pdf (432.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00881085 , version 1 (07-11-2013)
hal-00881085 , version 2 (07-03-2014)
hal-00881085 , version 3 (13-12-2014)
hal-00881085 , version 4 (25-09-2015)

Identifiers

Cite

Thomas Braibant, Jacques-Henri Jourdan, David Monniaux. Implementing and reasoning about hash-consed data structures in Coq. Journal of Automated Reasoning, 2014, 53 (3), pp.271-304. ⟨10.1007/s10817-014-9306-0⟩. ⟨hal-00881085v4⟩
904 View
826 Download

Altmetric

Share

Gmail Facebook X LinkedIn More