静态反汇编算法研究  

Research on Static Disassembly Algorithm

作　　者：许敏[1] 陈前斌[1] 

机构地区：[1]重庆邮电大学光互联网及无线信息网络研究中心,重庆400065

出　　处：《计算机与数字工程》2007年第5期13-16,共4页Computer & Digital Engineering

摘　　要：恶意代码通常都是以二进制代码形式发布的,利用这种形式的代码来分析程序的逻辑功能是非常困难的,而如果利用反汇编器将二进制代码转化为较容易理解的汇编代码将更利于对恶意代码的分析,因而研究二进制代码的反汇编算法显得极为重要。首先介绍两种传统的静态反汇编算法:线性遍历和递归遍历算法,分析它们的优点以及存在的问题,最后介绍现代静态反汇编算法的一些新的研究进展。Malicious codes are always distributed in binary codes, which is very difficult to analyze the logic function of the program, but if we convert binary codes into easier understood assembly codes by disassemblers, it will become more convenient to analyze malicious codes. Thus it becomes extremely important to explore the methods for disassembling binary codes. At first, this paper presents two traditional static disassembly algorithms: linear sweep and recursive traversal algorithms, analyzes their advantages and existing problems.Finally, some of the new research progresses of modern static disassembly algorithms are introduced.

关 键 词：静态反汇编 线性遍历递归遍历 推测反汇编 混合反汇编 

分 类 号：TP314[自动化与计算机技术—计算机软件与理论]