An efficient interprocedural dynamic slicing method
An efficient interprocedural dynamic slicing method
复制标题
一种高效的过程间动态切片方法
DOI：
10.1016/j.jss.2005.07.024
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
R. Mall
中科院分区：
文献类型：
--
作者：
G. B. Mund;R. Mall
本文提出了一种有效的结构化程序过程间动态切片算法。我们首先提出了一个过程内的动态切片算法，随后扩展它来处理过程间的调用。我们的过程内动态切片算法使用控制依赖图作为中间程序表示，并计算精确的动态切片。过程间动态切片算法使用控制依赖图的集合（每个过程一个）作为中间程序表示，并计算精确的动态切片。我们表明，我们提出的过程间动态切片算法是更有效的比现有的动态切片算法。我们还讨论了如何我们的算法可以扩展到有效地处理递归，复合数据结构和指针。
We present an efficient interprocedural dynamic slicing algorithm for structured programs. We first propose an intraprocedural dynamic slicing algorithm, and subsequently extend it to handle interprocedural calls. Our intraprocedural dynamic slicing algorithm uses control dependence graph as the intermediate program representation, and computes precise dynamic slices. The interprocedural dynamic slicing algorithm uses a collection of control dependence graphs (one for each procedure) as the intermediate program representation, and computes precise dynamic slices. We show that our proposed interprocedural dynamic slicing algorithm is more efficient than the existing dynamic slicing algorithms. We also discuss how our algorithm can be extended to efficiently handle recursion, composite data structures and pointers.