Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program representation called the system dependence graph. This paper defines a new algorithm for slicing with system dependence graphs that is asymptotically faster than the previous one. A preliminary experimental study indicates that the new algorithm is also significantly faster in practice, providing roughly a 6-fold speedup on examples of 348 to 757 lines.
No takes yet. Share an insight, caveat, or question.
Reps et al. (1994) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: