Changing the internal structure of a program without changing its behavior
is called restructuring. This paper presents a transformation called tuck f
or restructuring programs by decomposing large functions into small functio
ns. Tuck consists of three steps: Wedge, Split, and Fold. A wedge a subset
of statements in a slice - contains computations that are related and that
may create a meaningful function. The statements in a wedge are split from
the rest of the code and folded into a new function. A call to the new func
tion is placed in the now restructured function. That tuck does not alter t
he behavior of the original function follows from the semantic preserving p
roperties of a slice. (C) 1998 Elsevier Science B.V. All rights reserved.