Testing intermediate representation for binary analysis

Abstract

Binary lifting, which is to translate a binary executable to a high-level immediate representation, is a primary step in binary analysis. Despite its importance, there are only few existing approaches to testing the correctness of binary lifters. Furthermore, the existing approaches suffer from low test coverage, because they largely depend on random test case generation. In this thesis, we present the design and implementation of the first systematic approach to testing binary lifters. we have evaluated the proposed system on 3 state-of-the-art binary lifters, and found 24 previously unknown semantic bugs. Our result demonstrates that writing a precise binary lifter is extremely difficult even for those heavily tested projects.