University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > A verified runtime for a verified theorem prover

A verified runtime for a verified theorem prover

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact William Denman.

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. 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 designed to be trustworthy, has been formally verified and can run the Milawa theorem prover. Our runtime, which consists of 7,000 lines of machine code, is able to complete a 4 gigabyte Milawa proof effort.

The 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.

This talk describes joint work with Jared Davis.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity