[1]贾利敏,张忠林..一种简化依赖关系的动态程序切片算法[J].郑州大学学报(工学版),2009,30(02):84-87.
　JIA Limin,ZHANG Zhonglin.A Dynamic Program Slicing Algorithm that Simplifies Dependencies[J].Journal of Zhengzhou University (Engineering Science),2009,30(02):84-87.
点击复制

一种简化依赖关系的动态程序切片算法()
分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
30
期数:
2009年02期
页码:
84-87
栏目:
出版日期:
1900-01-01

文章信息/Info

Title:
A Dynamic Program Slicing Algorithm that Simplifies Dependencies
作者:
贾利敏; 张忠林.
兰州交通大学电子与信息工程学院,甘肃,兰州,730070, 兰州交通大学电子与信息工程学院,甘肃,兰州,730070
Author(s):
JIA Limin; ZHANG Zhonglin
School of Electronic and Information Engineering，Lanzhou Jiaotong University，Lanzhou 730070，China
关键词:
动态程序切片;  切片准则;  动态程序切片算法;  依赖关系;  程序依赖图
Keywords:
dynamic program slicing;  Slicing guidelines;  dynamic program slicing algorithm;  dependencies;  Program dependency diagram
文献标志码:
A
摘要:
动态程序切片是由影响程序中某个兴趣点处变量值的所有语句和控制谓词组成的一个程序子集.笔者提出了一种简化依赖关系的动态程序切片算法,主要目的是解决H.Agrawal的动态切片算法计算切片不太精确的问题,该算法通过程序执行轨迹,确定教据依赖结点、控制依赖结点和结点可到达语句来计算变量切片.实例证明,该算法提高了动态切片的精确度,减少了计算动态程序切片的复杂度.
Abstract:
A dynamic program slice is a subset of a program consisting of all statements and control predicates that affect the value of a variable at a certain point of interest in the program. The author proposes a dynamic program slicing algorithm that simplifies dependencies, the main purpose of which is to solve the problem that H. Agrawal’s dynamic slicing algorithm is not accurate in calculating slices, which calculates variable slicing by determining the dependent nodes, controlling dependent nodes and node reachable statements through the program execution trajectory. Examples show that the algorithm improves the accuracy of dynamic slicing and reduces the complexity of calculating dynamic program slicing.
更新日期/Last Update: 1900-01-01