University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Mechanically verified LISP interpreters

Mechanically verified LISP interpreters

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

If you have a question about this talk, please contact Thomas Tuerk.

Note unusual time

This talk describes work on constructing verified interpreters for a small LISP -like language using the interactive theorem prover HOL4 . The LISP interpreters have been proved correct with respect to detailed x86, ARM and PowerPC processor models. New techniques for expressing correctness of machine code were developed, as well as new techniques for proof-producing decompilation and compilation to/from HOL4 functions. A copying garbage collector (a Cheney collector) was verified and subsequent proofs were built upon its verified specification.

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