块结构的程序切片方法  

Block bsed pogram sicing

作　　者：张鹏[1] 王智学[1] 吕帅[1] 张睿[1] 刘磊[1] 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012

出　　处：《哈尔滨工程大学学报》2012年第11期1384-1393,共10页Journal of Harbin Engineering University

基　　金：国家自然科学基金资助项目(60873044);新世纪优秀人才支持计划基金资助项目(NCET100436);吉林省自然科学基金资助项目(20101509);中国博士后科学基金资助项目(2011M500612);中央高校基本科研业务费专项基金资助项目(201103124;201103133)

摘　　要：为弥补传统程序切片方法在切片点变量选择上的局限性,提出了一种灵活的切片准则,并基于该切片准则给出了一种新的切片方法.该方法将程序划分成一种块状结构,把切片划分为块内切片和块外切片,利用块内切片算法和块内切片迭代分别求取块内切片和块外切片的结果.实验结果表明,该方法是可行的,弥补了现有程序切片方法的缺陷.In order to cover the limitation of classical program slicing methods, which usually restrict the choice of variables on the slicing point, a new slicing method was proposed, based on flexible slicing criteria. The idea was to take a given program as a block structure, which was separated into the inside-block slicing and outside-block slicing. Respectively, algorithms including iteration were proposed for the two types of slicing. The experiment re- sults showed this method was feasible to cover the limitation of classical program slicing methods.

关 键 词：程序切片 程序块 控制流分析 数据流分析 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]