Testing intermediate representations for binary analysis
- Authors
- Kim, S.; Faerevaag, M.; Jung, M.; Jung, S.; Oh, D.; Lee, J.; Cha, S.K.
- Issue Date
- 2017
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Citation
- ASE 2017 - Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, pp.353 - 364
- Journal Title
- ASE 2017 - Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering
- Start Page
- 353
- End Page
- 364
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/6693
- DOI
- 10.1109/ASE.2017.8115648
- ISSN
- 0000-0000
- Abstract
- Binary lifting, which is to translate a binary executable to a high-level intermediate 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 paper, 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. © 2017 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 경영대학 > 금융수학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.