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

Recovery Technology of N-conditional Branch Statements Under Intricacy Mode

作　　者：张龙杰[1] 谢晓方[1] 袁胜智[1] 李洪周[1] 

机构地区：[1]海军航空工程学院兵器科学与技术系,烟台264001

出　　处：《计算机工程》2009年第21期67-70,共4页Computer Engineering

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

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

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