Mechanically verified LISP interpreters

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

• Magnus Myreen (University of Cambridge)
• Tuesday 11 November 2008, 12:00-13:00
• Computer Laboratory, William Gates Building, Room SS03.

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:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.