Mechanized Verification of CPS Transformations

Dargaye, Zaynah; Leroy, Xavier

doi:10.1007/978-3-540-75560-9_17

Cited by 16 publications

(16 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Much like our project, the VLISP project developed their interpreter in a subset of the source language: for them PreScheme, and for us, the input language of our augmented compiler, Section 4. Work that aims to implement functional languages, in a formally verified manner, include Pike et al [17] on a certifying compiler from Cryptol (a dialect of Haskell) to AAMP7 code; Dargaye and Leroy [4] on a certified compiler from mini-ML to PowerPC assembly; Li and Slind's work [10] on a certifying compiler from a subset of HOL4 to ARM assembly; and also Chlipala's certified compiler [3] from the lambda calculus to an invented assembly language. The above work either assumes that the environment implements run-time memory management correctly [3,4] or restricts the input language to a degree where no run-time memory management is needed [10,17].…”

Section: Discussion Of Related Workmentioning

confidence: 99%

Verified LISP Implementations on ARM, x86 and PowerPC

Myreen

Gordon

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper reports on a case study, which we believe is the first to produce a formally verified end-to-end implementation of a functional programming language running on commercial processors. Interpreters for the core of McCarthy's LISP 1.5 were implemented in ARM, x86 and PowerPC machine code, and proved to correctly parse, evaluate and print LISP s-expressions. The proof of evaluation required working on top of verified implementations of memory allocation and garbage collection. All proofs are mechanised in the HOL4 theorem prover.

show abstract

Section: Discussion Of Related Workmentioning

confidence: 99%

Verified LISP Implementations on ARM, x86 and PowerPC

Myreen

Gordon

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…[Dargaye and Leroy 2007;Chlipala 2010], closely related to conversion to SSA form. Chlipala [2010] verifies in Coq a compiler to an idealized as-sembly language from a small, untyped functional language with mutable references and exceptions.…”

Section: Machine-checked Formalizationsmentioning

confidence: 99%

Formal Verification of an SSA-Based Middle-End for CompCert

Barthe

Demange

Pichardie

2014

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

CompCert is a formally verified compiler that generates compact and efficient code for a large subset of the C language. However, CompCert foregoes using SSA, an intermediate representation employed by many compilers that enables writing simpler, faster optimizers. In fact, it has remained an open problem to verify formally an SSA-based compiler. We report on a formally verified, SSA-based, middle-end for CompCert. In addition to providing a formally verified SSA-based middle-end, we address two problems raised by Leroy in 2009: giving an intuitive formal semantics to SSA, and leveraging its global properties to reason locally about program optimizations.

show abstract

“…Recently, Leroy's Coq-verified C compiler [14], which targets PowerPC, ARM and 32-bit x86 assembly, has been extended with new front-ends that makes it compile MiniML [4] and a garbage-collected source language [16]. The latter extension has been connected to intermediate output from the Glasgow Haskell Compiler.…”

Section: The Combination Of Milawa and Jitawamentioning

confidence: 99%

A Verified Runtime for a Verified Theorem Prover

Myreen

Davis²

2011

Interactive Theorem Proving

View full text Add to dashboard Cite

Abstract. Theorem provers, such as ACL2, HOL, Isabelle and Coq, rely on the correctness of runtime systems for programming languages like ML, OCaml or Common Lisp. These runtime systems are complex and critical to the integrity of the theorem provers. In this paper, we present a new Lisp runtime which has been formally verified and can run the Milawa theorem prover. Our runtime consists of 7,500 lines of machine code and is able to complete a 4 gigabyte Milawa proof effort. When our runtime is used to carry out Milawa proofs, less unverified code must be trusted than with any other theorem prover. Our runtime includes a just-in-time compiler, a copying garbage collector, a parser and a printer, all of which are HOL4-verified down to the concrete x86 code. We make heavy use of our previously developed tools for machine-code verification. This work demonstrates that our approach to machine-code verification scales to non-trivial applications.

show abstract

Mechanized Verification of CPS Transformations

Cited by 16 publications

References 27 publications

Verified LISP Implementations on ARM, x86 and PowerPC

Verified LISP Implementations on ARM, x86 and PowerPC

Formal Verification of an SSA-Based Middle-End for CompCert

A Verified Runtime for a Verified Theorem Prover

Contact Info

Product

Resources

About