![[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 30 October 2007, 13:00-14:00
A tool for verification: A decompiler from ARM to HOL
- 👤 Speaker: Magnus Myreen (University of Cambridge)
- 📅 Date & Time: Tuesday 30 October 2007, 13:00 - 14:00
- 📍 Venue: Computer Laboratory, William Gates Building, Room SS03
Abstract
Speaker: Magnus Myreen
A year ago I presented a Hoare logic for machine code. The logic has since been used to verify a variety of programs, many with applications in elliptic curve cryptography but also a small garbage collector.
In this talk I will present some automation that was developed to ease the verification effort: a decompiler which given some ARM machine code produces a HOL function and proves that the ARM code executes the HOL function. Hence it performs the Hoare logic reasoning for the user and leaves the user to concentrate on proving properties of fairly clean HOL functions rather than Hoare triples (or next-state functions).
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 SS03
- 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.