传统的算法是通过建立程序的依赖图得到动态切片，但依赖图需要占用大量的空间，因此算法效率较低。
Traditional algorithms usually get dynamic program slices by building dependence graphs of the programs, but dependence graphs take lots of memory space, so they are inefficient.
文中提供的动态切片方法还克服了以往动态切片方法的缺点，即动态切片不会因切片标准变化而重新计算。
Besides efficiency, our approach overcomes the limitations of previous dynamic slicing methods, which have to redo if slicing criterion changes.
介绍了动态切片的基本概念，并将程序依赖图算法应用于动态切片，从而达到缩小程序分析范围的目的，讨论了动态切片在程序调试和软件测试中的应用。
The basic conceptions of dynamic slicing are introduced, to which the program dependence graph arithmatic is tried to apply, thus reducing the scope of program analysis.
应用推荐