A Program Slicing Method Using Lightweight Dynamic Information

概要

論文の詳細を見る
When we try to debug a large program effectively, it is very important to separate a suspicious program portion from the overall source program. Program slicing is a promising technique to extract a program portion; however, it remains difficult issues. Static slicing sometimes produces a large portion of the source program, and dynamic slicing requires unacceptably huge run-time overhead. In this paer, we discuss intermediate semi-dynamic methods between static and dynamic slicing. We propose a slicing methods named dependence-cache slicing. This algorithm has been implemented in our experimental slicing system, and execution data for several sample programs have been collected. The result shows that dependence-cache slice reduces the slice size by about 30-90% from the static slice size, even for programs using arrays, with affordable run-time overhead increase. These slicing methods will be important features for effective debugging environments.
社団法人電子情報通信学会の論文
2002-02-01