An algorithm for computing slices for recursive program

被引:1
|
作者
Ueda, R
Lian, L
Torii, K
机构
[1] OSAKA UNIV,FAC ENGN SCI,TOYONAKA,OSAKA 560,JAPAN
[2] NARA WOMENS UNIV,DEPT FOOD SCI & NUTR,IKOMA,NARA 630,JAPAN
关键词
program dependence graph; reaching definition set; recursion; control dependence graph; data dependence;
D O I
10.1002/scj.4690270305
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Program slicing is a useful technique for debugging, testing and program integration. Intuitively, by the slice of a program P is meant, for a point n and a variable v in P, the set of statements and expressions in P that affect the value of v at n. To determine a slice, there must be a precise analysis of the dependencies among the statements in the program. It is difficult, on the other hand, to analyze the program containing recursions.
引用
收藏
页码:46 / 59
页数:14
相关论文
共 50 条