A Verified Compiler from Isabelle/HOL to CakeML

Hupel, Lars; Nipkow, Tobias

doi:10.1007/978-3-319-89884-1_35

Cited by 33 publications

(25 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Examples include the online social media platform and the SAT solver reported in two of this special issue's papers. The framework also supports current work on a verified optimized model checker, as well as an effort to not only extract code, but to extract verified code [7] using the verified CakeML compiler.…”

Section: Overview Of the Contentsmentioning

confidence: 98%

Introduction to Milestones in Interactive Theorem Proving

et al. 2018

View full text Add to dashboard Cite

Section: Overview Of the Contentsmentioning

confidence: 98%

Introduction to Milestones in Interactive Theorem Proving

et al. 2018

View full text Add to dashboard Cite

“…Proof engineering for certified compilers has had applications directly to the languages these compilers are verified in. 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.…”

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

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

“…Most recently, Hupel [HN18] has provided an alternative verified code generator that translates HOL into CakeML, an ML-like functional language with a verified compiler [KMNO14]. CakeML is the only backend for code generation that doesn't have to be trusted, since the CakeML compiler has itself been verified formally.…”

Section: Historymentioning

confidence: 99%

From LCF to Isabelle/HOL

Paulson

Nipkow

Wenzel³

2019

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its distinctive strengths. They include automatic proof search, borrowing techniques from the world of first order theorem proving, but also the automatic search for counterexamples. They include a highly readable structured language of proofs and a unique interactive development environment for editing live proof documents. Everything rests on the foundation conceived by Robin Milner for Edinburgh LCF: a proof kernel, using abstract types to ensure soundness and eliminate the need to store proofs. Compared with the research prototypes of the 1970s, Isabelle is a practical and versatile tool. It is used by system designers, mathematicians and many others.Isabelle is a leading interactive theorem prover. It is generic, supporting a number of different formal calculi, but by far the most important of these is its instantiation to higher-order logic: Isabelle/HOL. Already during the 1990s, Isabelle/HOL was being applied with great success to the task of verifying cryptographic protocols [Pau98]. Turning to mathematics, it played a critical role in Hales's Flyspeck project, which verified his proof of the Kepler conjecture [HAB + 17]. It is the basis for the seL4 project, under which an entire operating system kernel was verified, proving full functional correctness [KAE + 10]. It was adopted by researchers outside the verification milieu for specifying and verifying algorithms for replicated datatypes that provide "eventual consistency" [GKMB17]. Numerous other projects are underway around the world. Like other proof assistants, Isabelle is not directly concerned with program verification, i.e. with verifying code written in a programming language, but it can be used as a back end to prove verification conditions. Isabelle can also be used as a verified programming environment, where mathematical functions can be proved correct and then automatically translated to executable code in one of several different programming languages. The translation process itself is currently unverified, but even this is likely to change in the near future.This essay focuses on Isabelle/HOL and therefore has little to say about techniques common to most systems. For example, simplification by rewriting-coupled with recursive simplification to handle conditional rewrite rules-was already realised in both the Boyer/Moore theorem prover [BM79] and Edinburgh LCF by the end of the 1970s. Recursive datatype and function definitions, as well as inductive definitions, were commonplace by around 1995. Linear arithmetic decision procedures were also widely available by then.Our title echoes Mike Gordon's paper "From LCF to HOL: a Short History" [Gor00]. Like Mike, we begin with LCF, the source of the most fundamental ideas. But we pass over this material quickly in order to focus on Isabelle. There is no way to surpass Mike's account of the early years. He starts in 1969, wi...

show abstract

A Verified Compiler from Isabelle/HOL to CakeML

Cited by 33 publications

References 39 publications

Introduction to Milestones in Interactive Theorem Proving

Introduction to Milestones in Interactive Theorem Proving

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

From LCF to Isabelle/HOL

Contact Info

Product

Resources

About