University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Proof-producing decompilation and compilation

Proof-producing decompilation and compilation

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

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.

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