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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Mechanically verified LISP interpreters

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Basement Room The Darwin Room, The Pitt Building, Trumpington Street, Cambridge Workstation area and Lecture Theatre 1, Computer Laboratory

Other talks

Bacterial Physiology During Growth Arrest: Can It Be Targeted by Anti-Bacterial Therapeutics? The Imagined Conflict: On Science and God Title tbc Alicia Anderson discussing some exciting news about HARPS3 Title to be confirmed Talk TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity