University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > A tool for verification: A decompiler from ARM to HOL

A tool for verification: A decompiler from ARM to HOL

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

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

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).

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