Proof-producing decompilation and compilation

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

• Magnus Myreen (University of Cambridge)
• Tuesday 27 May 2008, 13:00-14:00
• Computer Laboratory, William Gates Building, Room GS15.

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

Room changed

Realistic formal specifications of machine languages for commercial processors consist of thousands of lines of definitions. Current methods support formal proofs of the correctness of programs for one such specification. However, these methods provide little or no support for reusing proofs of the same algorithm implemented in different machine languages.

I’ll describe an approach, based on proof-producing decompilation, which both makes machine-code verification tractable and supports proof reuse between different languages. With minor modifications a decompiler can be changed into compiler, which plugs together verified program components.

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 GS15
• 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.