DocumentCode :
568654
Title :
Reversing Engineering Data Structures in Binary Programs: Overview and Case Study
Author :
Sun, XiaoXia ; Chen, Hua ; Wen, Yan ; Huang, MinHuan
Author_Institution :
Beijing Inst. of Syst. Eng., Beijing, China
fYear :
2012
fDate :
4-6 July 2012
Firstpage :
400
Lastpage :
404
Abstract :
All the unnecessary information of data structures and types is removed at the end of compilation. However, the high level information is extremely valuable and necessary for many fields such as debugging, reverse engineering, security etc. Without data structures information, reverse engineering is extremely hard to perform. Unfortunately, even the most advanced techniques and tools for reverse engineering are very weak in this part. Recently, several new solutions have been proposed and each has made some achievements. In this paper, we summarize challenges in this problem, then analyze three existing outstanding approaches, discuss their limitations and at last propose some possible directions to make further efforts.
Keywords :
data structures; program compilers; reverse engineering; binary program compilation; data structures; high-level information; reverse engineering; Algorithm design and analysis; Data structures; Malware; Protocols; Reverse engineering; Semantics; Malware; data structures; reverse engineering; type reconstruction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2012 Sixth International Conference on
Conference_Location :
Palermo
Print_ISBN :
978-1-4673-1328-5
Type :
conf
DOI :
10.1109/IMIS.2012.102
Filename :
6296886
Link To Document :
بازگشت