Œuf: minimizing the Coq extraction TCB

Mullen, Eric; Pernsteiner, Stuart; Wilcox, J. R.; Tatlock, Zachary; Grossman, Dan

doi:10.1145/3167089

Cited by 30 publications

(22 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For example, there are certified compilers both from HOL4 (Myreen and Owens, 2012) and from Isabelle/HOL (Hupel and Nipkow, 2018) to CakeML; it is possible to produce machine code by composing these compilers with the certified CakeML compiler. Both CertiCoq (Anand et al, 2017) and OEuf (Mullen et al, 2018) describe certified compilers for Coq's specification language Gallina. CertiCoq is an ongoing project to build a certified compiler from Gallina to machine code, using a hierarchy of custom intermediate languages.…”

Section: Certified Compilersmentioning

confidence: 99%

QED at Large: A Survey of Engineering of Formally Verified Software

Ringer

Palmskog

Sergey

et al. 2019

FNT in Programming Languages

Self Cite

View full text Add to dashboard Cite

Development of formal proofs of correctness of programs can increase actual and perceived reliability and facilitate better understanding of program specifications and their underlying assumptions. Tools supporting such development have been available for over 40 years, but have only recently seen wide practical use. Projects based on construction of machine-checked formal proofs are now reaching an unprecedented scale, comparable to large software projects, which leads to new challenges in proof development and maintenance. Despite its increasing importance, the field of proof engineering is seldom considered in its own right; related theories, techniques, and tools span many fields and venues. This survey of the literature presents a holistic understanding of proof engineering for program correctness, covering impact in practice, foundations, proof automation, proof organization, and practical proof development.

show abstract

Section: Certified Compilersmentioning

confidence: 99%

QED at Large: A Survey of Engineering of Formally Verified Software

Ringer

Palmskog

Sergey

et al. 2019

FNT in Programming Languages

Self Cite

View full text Add to dashboard Cite

show abstract

“…Hence, for the moment, our work includes Extraction in its TCB but so do many other projects such as, e. g., the CompCert compiler. 10 Still concerning verifying Coq extraction in Coq, we also mention the OEuf 11 project [12], but there is work of similar nature also in the Isabelle community [6]. Notice that we expect no or little change in the resulting extracted OCaml programs (once MetaCoq or one of its competitors reaches its goal) since these must respect the computational content of Coq terms.…”

Section: Verification Certification and The Trusted Computing Basementioning

confidence: 99%

Certification of Breadth-First Algorithms by Extraction

Larchey-Wendling¹,

Matthes²

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

By using pointers, breadth-first algorithms are very easy to implement efficiently in imperative languages. Implementing them with the same bounds on execution time in purely functional style can be challenging, as explained in Okasaki's paper at ICFP 2000 that even restricts the problem to binary trees but considers numbering instead of just traversal. Okasaki's solution is modular and factors out the problem of implementing queues (FIFOs) with worst-case constant time operations. We certify those FIFO-based breadth-first algorithms on binary trees by extracting them from fully specified Coq terms, given an axiomatic description of FIFOs. In addition, we axiomatically characterize the strict and total order on branches that captures the nature of breadthfirst traversal and propose alternative characterizations of breadth-first traversal of forests. We also propose efficient certified implementations of FIFOs by extraction, either with pairs of lists (with amortized constant time operations) or triples of lazy lists (with worst-case constant time operations), thus getting from extraction certified breadth-first algorithms with the optimal bounds on execution time. Keywords: Breadth-first algorithms • Queues in functional programming • Correctness by extraction • Coq The first author got financial support by the TICAMORE joint ANR-FWF project. The second author got financial support by the COST action CA15123 EUTYPES.

show abstract

“…Another direction is taken by the OEuf certified compiler [19], which restricts itself to a fragment of Coq for which a total denotation function can be defined, in the tradition of definitional interpreters advocated by Chlipala [10]. This setup should be readily accommodated by Template-Coq.…”

Section: Related Work and Future Workmentioning

confidence: 99%

Towards Certified Meta-Programming with Typed Template-Coq

Anand

Boulier

Cohen

et al. 2018

Interactive Theorem Proving

View full text Add to dashboard Cite

Abstract. Template-Coq (https://template-coq.github.io/templatecoq) is a plugin for Coq, originally implemented by Malecha [18], which provides a reifier for Coq terms and global declarations, as represented in the Coq kernel, as well as a denotation command. Initially, it was developed for the purpose of writing functions on Coq's AST in Gallina. Recently, it was used in the CertiCoq certified compiler project [4], as its front-end language, to derive parametricity properties [3], and to extract Coq terms to a CBV λ-calculus [13]. However, the syntax lacked semantics, be it typing semantics or operational semantics, which should reflect, as formal specifications in Coq, the semantics of Coq's type theory itself. The tool was also rather bare bones, providing only rudimentary quoting and unquoting commands. We generalize it to handle the entire Calculus of Inductive Constructions (CIC), as implemented by Coq, including the kernel's declaration structures for definitions and inductives, and implement a monad for general manipulation of Coq's logical environment. We demonstrate how this setup allows Coq users to define many kinds of general purpose plugins, whose correctness can be readily proved in the system itself, and that can be run efficiently after extraction. We give a few examples of implemented plugins, including a parametricity translation. We also advocate the use of Template-Coq as a foundation for higher-level tools.

show abstract

Œuf: minimizing the Coq extraction TCB

Cited by 30 publications

References 32 publications

QED at Large: A Survey of Engineering of Formally Verified Software

QED at Large: A Survey of Engineering of Formally Verified Software

Certification of Breadth-First Algorithms by Extraction

Towards Certified Meta-Programming with Typed Template-Coq

Contact Info

Product

Resources

About