Binary rewriting without relocation information

• US 8,510,723 B2
• Filed: 05/24/2010
• Issued: 08/13/2013
• Est. Priority Date: 05/29/2009
• Status: Active Grant

• Current Assignee: University of Maryland
• Original Assignee: University of Maryland
• Inventors: Barua, Rajeev Kumar, Smithson, Matthew
• Primary Examiner(s): Dao, Thuy
• Assistant Examiner(s): Wang, Ben C
• Application Number:
  US12/785,923
• Publication Number:
  US 20100306746A1
• Time in Patent Office: 1,177 Days
• Field of Search: None
• US Class Current: 717/136
• CPC Class Codes: G06F 8/52 Binary to binary

Abstract

A binary rewriter that can provide complete code coverage without relocation information is provided, together with a method of performing such rewriting. The method can include processing a binary file as an original binary file. The method can also include disassembling the binary file to provide a disassembled binary file. The method can further include rewriting the disassembled binary file without relocation information to provide a rewritten binary file. The rewriting can provide a physical transformation in a recording medium relative to the binary file in the recording medium prior to the rewriting. The processing the binary file, disassembling the binary file, and rewriting the disassembled binary file can be performed by a particular machine.

Claims

1. A method, comprising:

processing a binary file in a format that includes indirect control transfers as an original binary file;

disassembling all the code in the binary file without relocation information to provide a disassembled binary file;

rewriting the disassembled binary file without relocation to provide a converted program,

wherein the rewriting provides a physical transformation in a recording medium relative to the binary file in the recording medium prior to the rewriting, and wherein the processing the binary file, disassembling the binary file, and rewriting the converted program are performed by a particular machine.

2. The method of claim 1, wherein the rewriting comprising performing constant reaching-definitions analysis.

3. The method of claim 1, wherein the rewriting comprises performing memory address analysis.

4. The method of claim 1, wherein the rewriting and disassembling comprise performing iterative disassembly.

5. The method of claim 1, wherein the rewriting comprises performing profiling-based code discovery.

6. The method of claim 1, wherein the rewriting comprises performing constant propagation for indirect transfer targets.

7. The method of claim 1, wherein the rewriting comprises writing, as a part of the rewritten binary file, the original binary file.

8. The method of claim 1, wherein the writing the completely rewritten code comprises writing all possible legal disassembly code sequences.

9. The method of claim 1, wherein the rewriting comprises writing, as a part of the rewritten binary file, a call translator.

10. The method of claim 9, wherein the rewriting comprises writing, as a part of the rewritten binary file, a call translation table.

11. The method of claim 1, wherein the rewriting comprises writing, as a part of the rewritten binary file, a branch translator.

12. The method of claim 11, wherein the rewriting comprises writing, as a part of the rewritten binary file, a branch translation table.

13. The method of claim 1, wherein the disassembling comprises determining functions.

14. The method of claim 1, wherein the disassembling comprises speculative disassembling.

15. The method of claim 1, wherein the method is configured to permit transformation or optimization beyond just instrumentation or localized optimization.

16. A non-transitory computer-readable medium encoded with instructions that, when executed in hardware, perform a process, the process comprising:

processing a binary file in a format that includes indirect control transfers as an original binary file;

disassembling all the code in the binary file without relocation information to provide a disassembled binary file;

rewriting the disassembled binary file without relocation information to provide a converted program,

wherein the rewriting provides a physical transformation in a recording medium relative to the binary file in the recording medium prior to the rewriting, and wherein the processing the binary file, disassembling the binary file, and rewriting the converted program are performed by the hardware.

17. The computer-readable medium of claim 16, wherein the rewriting comprising performing constant reaching-definitions analysis.

18. The computer-readable medium of claim 16, wherein the rewriting comprises performing memory address analysis.

19. The computer-readable medium of claim 16, wherein the rewriting and disassembling comprise performing iterative disassembly.

20. The computer-readable medium of claim 16, wherein the rewriting comprises performing profiling-based code discovery.

21. The computer-readable medium of claim 16, wherein the rewriting comprises performing constant propagation for indirect transfer targets.

22. The computer-readable medium of claim 16, wherein the rewriting comprises writing, as a part of the rewritten binary file, the original binary file.

23. The computer-readable medium of claim 16, wherein the writing the completely rewritten code comprises writing all possible legal disassembly code sequences.

24. The computer-readable medium of claim 16, wherein the rewriting comprises writing, as a part of the rewritten binary file, a call translator.

25. The computer-readable medium of claim 24, wherein the rewriting comprises writing, as a part of the rewritten binary file, a call translation table.

26. The computer-readable medium of claim 16, wherein the rewriting comprises writing, as a part of the rewritten binary file, a branch translator.

27. The computer-readable medium of claim 26, wherein the rewriting comprises writing, as a part of the rewritten binary file, a branch translation table.

28. The computer-readable medium of claim 16, wherein the disassembling comprises determining functions.

29. The computer-readable medium of claim 16, wherein the disassembling comprises speculative disassembling.

30. The computer-readable medium of claim 16, wherein the process is configured to permit transformation or optimization beyond just instrumentation or localized optimization.

31. An apparatus, comprising:

a processor configured to process a binary file in a format that includes indirect control transfers as an original binary file;

a disassembler configured to disassemble all the code in the binary file without relocation information to provide a disassembled binary file;

a rewriter configured to rewrite the disassembled binary file without relocation information to provide a converted program,

wherein rewriting provides a physical transformation in a recording medium relative to the binary file in the recording medium prior to the rewriting.