One of the important issues in constructing interprocedural program slices is maintaining
In this paper, we evaluate a PDG based explicitly context-sensitive interprocedural program slicing technique for accuracy and efficiency. We compare this technique against a context-insensitive technique using a program slicing framework we have developed for Java programs for which only the byte-code sequences are available.
Our results show that the context-sensitive technique, in spite of its worst case exponential complexity, can be very efficient in practice. The execution time for our set of benchmarks is, on the average, only twice as much as the execution time for the context-insensitive technique. The results on the accuracy for the context-insensitive technique are mixed. For 53% of the 2464 slicing criteria used in our experiments, the context-insensitive technique does not loose accuracy. However, in some cases, it can also lead to slices with 35 times more vertices. On the average, the slices constructed from the context-insensitive technique are twice as large as the one from the context-sensitive technique.
机译:明确评估上下文相关程序切片
机译:并发AspectJ程序的动态切片:一种显式的上下文相关方法
机译:分布式的面向方面程序的动态切片:一种上下文相关的方法
机译:显式评估上下文相关程序切片
机译:来自程序切片的可执行文件用于Java程序
机译:上下文敏感的突触可塑性和海马切片中的时空转换
机译:明确评估上下文相关程序切片