作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (21): 67-70. doi: 10.3969/j.issn.1000-3428.2009.21.023

• 软件技术与数据库 • 上一篇    下一篇

复杂模式下的多分支语句恢复技术

张龙杰,谢晓方,袁胜智,李洪周   

  1. (海军航空工程学院兵器科学与技术系,烟台 264001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-11-05 发布日期:2009-11-05

Recovery Technology of N-conditional Branch Statements Under Intricacy Mode

ZHANG Long-jie, XIE Xiao-fang, YUAN Sheng-zhi, LI Hong-zhou   

  1. (Department of Science and Technology of Weapons, Naval Aeronautical and Astronautical University, Yantai 264001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-11-05 Published:2009-11-05

摘要: 对多分支结构编译后的各种实现模式进行研究分析,对复杂条件下典型的多分支语句实现模式进行形式化描述,在多分支结构的识别过程中,分析索引表和跳转表调用指令的格式,提出双特征指令匹配算法。通过程序切片,建立索引表和跳转表调用的表达式标准型,消除多分支语句恢复过程中编译器类型和版本差异的影响,提高了算法通用性。

关键词: 多分支, 跳转表, 索引表, 程序切片

Abstract: This paper researches and analyzes the compiling strategy of n-conditional branch statements, and offers a formal description to the typical realization strategy of n-conditional branch statements under intricacy mode. By analyzing the formats of calling instructions to the index table and the jump table, a novel recognition algorithm is proposed based on characteristic instruction matching. To eliminate the influence caused by type and edition varieties of different compilers, it establishes two standard calling expressions to the index table and the jump table, which improves the universality of the algorithm.

Key words: n-conditional branch, jump table, index table, program slicing

中图分类号: