A Relocation Information-based Revisited Method for Disassembly
一种基于重定位信息的二次反汇编算法

Binary disassembly routines form a fundamental component of software systems that statically analyze or modify executable programs. Linear Sweep algorithm and Rrecursive Traversal are two popular methods used by many systems that analyze or modify executable file. The former has the disadvantage that any data that is embedded in the instruction stream is misinterpreted while the latter has difficulty in dealing with indirect jumps. This article examines these two algorithms and illustrates their shortcomings. Relocation Information is used to improve them. A novel revisited method is given by combining the two improved algorithm which can detect situations where the disassembly may be incorrect and limit the extent of such disassembly errors.