Sat 18 Jun 2022 03:50 - 04:10 at Kon-Tiki - Verification II
Lifting binaries to a higher-level representation is an essential step for decompilation, binary verification, patching and security analysis. In this paper, we present the first approach to \emph{provably overapproximative} x86-64 binary disassembly. A stripped binary is verified for certain sanity properties such as return address integrity and calling convention adherence. Establishing these properties allows the binary to be lifted to a representation that contains an overapproximation of all possible execution paths of the binary. The lifted representation contains disassembled instructions, reconstructed control flow and invariants that are sufficient to prove soundness. We apply this approach to Linux Foundation and Intel’s Xen Hypervisor covering about 400K instructions. This demonstrates our approach is the first approach to provably overapproximative binary lifting scalable to commercial off-the-shelf systems. The lifted representation can be exported to the Isabelle/HOL theorem prover, allowing formal verification of its soundness.
Fri 17 JunDisplayed time zone: Pacific Time (US & Canada) change
15:30 - 16:50 | |||
15:30 20mTalk | Relational Compilation for Performance-Critical Applications PLDI Clément Pit-Claudel EPFL, AWS, Jade Philipoom MIT CSAIL, Dustin Jamner MIT CSAIL, Andres Erbsen MIT CSAIL, Adam Chlipala MIT CSAIL Link to publication DOI Pre-print | ||
15:50 20mTalk | Formally Verified Lifting of C-compiled x86-64 Binaries PLDI Freek Verbeek Open University of The Netherlands & Virginia Tech, Joshua A. Bockenek Virginia Tech, Zhoulai Fu University of California, Davis, Binoy Ravindran Virginia Tech DOI | ||
16:10 20mTalk | Leapfrog: Certified Equivalence for Protocol Parsers PLDI Ryan Doenges Cornell University, Tobias Kappé ILLC, University of Amsterdam, John Sarracino Cornell University, Nate Foster Cornell University, Greg Morrisett Cornell Tech DOI Pre-print | ||
16:30 20mTalk | Computing Correctly with Inductive Relations PLDI Zoe Paraskevopoulou Northeastern University, Aaron Eline University of Maryland, Leonidas Lampropoulos University of Maryland DOI |
Sat 18 JunDisplayed time zone: Pacific Time (US & Canada) change
03:30 - 04:50 | |||
03:30 20mTalk | Relational Compilation for Performance-Critical Applications PLDI Clément Pit-Claudel EPFL, AWS, Jade Philipoom MIT CSAIL, Dustin Jamner MIT CSAIL, Andres Erbsen MIT CSAIL, Adam Chlipala MIT CSAIL Link to publication DOI Pre-print | ||
03:50 20mTalk | Formally Verified Lifting of C-compiled x86-64 Binaries PLDI Freek Verbeek Open University of The Netherlands & Virginia Tech, Joshua A. Bockenek Virginia Tech, Zhoulai Fu University of California, Davis, Binoy Ravindran Virginia Tech DOI | ||
04:10 20mTalk | Leapfrog: Certified Equivalence for Protocol Parsers PLDI Ryan Doenges Cornell University, Tobias Kappé ILLC, University of Amsterdam, John Sarracino Cornell University, Nate Foster Cornell University, Greg Morrisett Cornell Tech DOI Pre-print | ||
04:30 20mTalk | Computing Correctly with Inductive Relations PLDI Zoe Paraskevopoulou Northeastern University, Aaron Eline University of Maryland, Leonidas Lampropoulos University of Maryland DOI |