Precise dynamic slicing using execution-summary
Avik Paul, Rajeev Kumar · 2007
Dynamic slicing helps to identify the program statements that affect a given criterion-point. Existing precise slicing algorithms, like the Limited-Preprocessing (LP) algorithm by Zhang et al. (ICSE 2003), operate on stored execution trace, requires much time and space if the trace is large even if the source program is small. In this paper we present a forward dynamic slicing algorithm for structured programs that reduces the overhead of slicing in the long run. For long running programs that iterates heavily on some loop, our algorithm is expected to perform faster by re-using the already computed dependences in the loop.