BinHunt: Automatically finding semantic differences in binary programs

212Citations
Citations of this article
133Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce BinHunt, a novel technique for finding semantic differences in binary programs. Semantic differences between two binary files contrast with syntactic differences in that semantic differences correspond to changes in the program functionality. Semantic differences are difficult to find because of the noise from syntactic differences caused by, e.g., different register allocation and basic block re-ordering. BinHunt bases its analysis on the control flow of the programs using a new graph isomorphism technique, symbolic execution, and theorem proving. We implement a system based on BinHunt and demonstrate the application of the system with three case studies in which BinHunt manages to identify the semantic differences between an executable and its patched version, revealing the vulnerability that the patch eliminates. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gao, D., Reiter, M. K., & Song, D. (2008). BinHunt: Automatically finding semantic differences in binary programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5308 LNCS, pp. 238–255). Springer Verlag. https://doi.org/10.1007/978-3-540-88625-9_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free