A Dynamic Program Slicing Algorithm that Simplifies Dependencies
[1]JIA Limin,ZHANG Zhonglin.A Dynamic Program Slicing Algorithm that Simplifies Dependencies[J].Journal of Zhengzhou University (Engineering Science),2009,30(02):84-87.
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
30
Number of periods:
2009年02期
Page number:
84-87
Column:
Public date:
1900-01-01
- Title:
- A Dynamic Program Slicing Algorithm that Simplifies Dependencies
- Keywords:
- dynamic program slicing; Slicing guidelines; dynamic program slicing algorithm; dependencies; Program dependency diagram
- CLC:
- -
- DOI:
- -
- 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.
- References:
- -
- Similar References:
Memo
-
Last Update:
1900-01-01