An approach of coarse-grained dynamic slice for Java program

Dynamic slicing approach is a well-know debugging technique by narrowing the analysis region of program for user. Dynamic slicing requires trace program execution and the trace can be at various levels of granularity. However fine grained execution traces like statement and bytecode need a large amount of CPU time and memory space to obtain it. In this paper we design an approach of Java program dynamic slicing which only collects method execution trace and then build program dependence graph based-on the dynamic execution information and static information. We also design a filter and method cache which used to improve the precision of our dynamic slice and enhance the efficiency of constructing graph. Finally we evaluate our slicing approach through experiments and discuss how our ideas can be used to fault location.