Scalable variable and data type detection in a binary rewriter

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2013, Pages 51-60

  El Wazeer, Khaled ^a   Anand, Kapil ^a   Kotha, Aparna ^a   Smithson, Matthew ^a   Barua, Rajeev ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Binary rewriting; Reverse engineering; Variable recov

Indexed keywords

BINARY REWRITING; DATA TYPE; EXECUTABLES; FLOATING POINTS; FUNCTION PROTOTYPE; INTERMEDIATE REPRESENTATIONS; VARIABLE RECOV;

COMPUTER PROGRAMMING LANGUAGES; REVERSE ENGINEERING;

PROGRAM COMPILERS;

EID: 84883093655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2462156.2462165     Document Type: Conference Paper

References (22)

1. Idapro, Hexrays. http://www.hex-rays.com/idapro/.
2. The LLVM Compiler Infrastructure. URL http://www.llvm. org.
3. K. Anand, M. Smithson, K. ElWazeer, A. Kotha, J. Gruen, N. Giles, and R. Barua. A compiler-level intermediate representation based binary analysis and rewriting system. In EuroSys, 2013.
4. G. Balakrishnan and T. Reps. Analyzing memory accesses in x86 executables. In CC, 2004.
5. G. Balakrishnan and T. Reps. DIVINE: Discovering variables in executables. In VMCAI, 2007.
6. R. Barua and M. Smithson. Binary rewriting without relocation information, May 24 2010. US Patent App. 12/785,923.
7. J. Caballero, N. M. Johnson, S. McCamant, and D. Song. Binary code extraction and interface identification for security applications. In NDSS, 2010.
8. C. Cifuentes and M. V. Emmerik. UQBT: Adaptable Binary Translation at Low Cost. Computer, 33(3):60-66, Mar. 2000.
9. C. Cifuentes and D. Simon. Procedure abstraction recovery from binary code. In Software Maintenance and Reengineering, 2000.
10. E. Dolgova et al. Automatic reconstruction of data types in the decompilation problem. Programming and Computer Software, 35: 105-119, 2009.
11. K. Elwazeer, K. Anand, M. Smithson, A. Kotha, and R. Barua. Recovering function boundaries from executables. Technical report, 2013. URL http://www.ece.umd.edu/~barua/function-boundaries.pdf.
12. M. Emmerik and T. Waddington. Using a decompiler for real-world source recovery. In Working Conference on Reverse Engineering, 2004.
13. A. Eustace and A. Srivastava. ATOM: a flexible interface for building high performance program analysis tools. In Proceedings of the USENIX 1995 Technical Conference Proceedings, TCON'95, 1995.
14. J. Lee, T. Avgerinos, and D. Brumley. TIE: Principled reverse engineering of types in binary programs. In NDSS, 2011.
15. Z. Lin, X. Zhang, and D. Xu. Automatic reverse engineering of data structures from binary execution. In NDSS, 2010.
16. C.-K. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, V. J. Reddi, and K. Hazelwood. Pin: building customized program analysis tools with dynamic instrumentation. SIGPLAN Not., 40:190-200, June 2005.
17. A. Mycroft. Type-based decompilation. In Proceedings of the 8th European Symposium on Programming, 1999.
18. S. Nanda, W. Li, L.-C. Lam, and T.-c. Chiueh. BIRD: Binary Interpretation using Runtime Disassembly. In CGO, 2006.
19. B. Schwarz et al. PLTO: A Link-Time Optimizer for the Intel IA-32 Architecture. In In Proc. 2001 Workshop on Binary Translation, 2001.
20. M. Smithson, K. Anand, A. Kotha, K. Elwazeer, N. Giles, and R. Barua. Binary rewriting without relocation information. Technical report, 2010. URL http://www.ece.umd.edu/~barua/without-relocation-technical-report10.pdf.
21. K. Troshina, Y. Derevenets, and A. Chernov. Reconstruction of composite types for decompilation. In Source Code Analysis and Manipulation (SCAM), 2010.
22. J. Zhang, R. Zhao, and J. Pang. Parameter and return-value analysis of binary executables. In COMPSAC, 2007.