![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 27 May 2008, 13:00-14:00
Proof-producing decompilation and compilation
- đ¤ Speaker: Magnus Myreen (University of Cambridge)
- đ Date & Time: Tuesday 27 May 2008, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room GS15
Abstract
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.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- 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
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.