Decomposition slicing [7] is an extension of the technique of program slicing [23]. A program slice captures all the computation that contributed to the value of a variable at a particular point, usually a line number. Program slicing can be applied to program integration [9], data-flow testing [13], debugging [16] and program understanding [22]. Methods to extend and improve the techniques of program slicing are still appearing [2,21].
Decomposition slicing applies program slicing to the maintenance problem. A decomposition slice captures all computation on a variable. This permits a maintainer to analyze all effects of proposed changes to a particular variable and to isolate the effect of those proposed changes. Decomposition slicing does not depend on any specific technique of program slicing, per se, but faster and more accurate slicing algorithms certainly improve the quality of the decompositions.
Copyright © 1994, 1995 Keith B. Gallagher, Bradley M. Kuhn, Dennis J. Smith.
Verbatim copying and distribution of this entire paper is permitted in any medium, provided this notice is preserved.