检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴伟民[1] 司斯[1] 阮奕邦 林志毅[1] 蔡欣童
机构地区:[1]广东工业大学计算机学院,广东广州510006
出 处:《计算机应用与软件》2014年第1期85-88,164,共5页Computer Applications and Software
摘 要:针对传统静态递归反汇编算法因无法解析间接跳转指令而导致反汇编结果不完整的问题,提出一种基于函数划分块和置信度的递归反汇编算法:以函数为划分块,对代码间隙进行多次递归扫描,获取反汇编过程中可能遗漏的重要基本块;建立置信度评估函数,以置信度为依据,剔除冲突的基本块,筛选出高置信度的基本块,用于补充和优化反汇编结果。实验证明,改进后的递归反汇编算法具有较高的反汇编精度。Traditional static recursive disassembly algorithms fail to resolve indirect jump instructions which results in incomplete disassem- bly outputs. Therefore a recursive disassembly algorithm based on function division block and confidence is proposed. The algorithm regards functions as division blocks to carry out several recursive scans upon code gaps to obtain the possible missing important basic blocks during the disassembly process. Then it establishes the confidence evaluation function, which, by comparing confidence degrees to erase conflicting bas- ic blocks, then chooses high confident basic blocks for completing and optimizing disassembly results. Experiments prove that the improved recursive disassembly algorithm performs better on disassembly accuracy.
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49