Techreport,
An efficient interprocedural slicing method for large programs
Technical Report, TR97-7. Informatics Lab., MTA SZTAKI, (June 1997)
Abstract
In this paper a method is introduced for the interprocedural static
slicing of large programs. The most time-consuming part of interprocedural
slicing methods is the computation of transitive dependencies (i.e.,
summary edges) due to the procedure calls. From these dependencies
and program dependence graphs the system dependence graph of a program
can be constructed. It is straightforward to compute interprocedural
slices from the system dependence graph. Horwitz et al. introduced
an algorithm based on attribute grammars for computing summary edges,
while Reps et al. suggested an improved technique for this task.
This paper defines a method which improves the space requirement
of Reps' method.
