Program slicing

This is an old revision of this page, as edited by Vonkje (talk | contribs) at 17:54, 10 June 2005 (Added in context of use). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Static slicing is a technique in an area of computer programming known as Software maintenance. It is used to identify all program code that can in anyway affect the value of a given variable. The following paragraph informally describes this computation.

Based on the original definition of Weiser a static program slice S consists of all statements in program P that may affect the value of variable v at some point p. The slice is defined for a slicing criterion C=(x,V), where x is a statement in program P and V is a subset of variables in P. A static slicing includes all the statements that affect variable v for a set of all possible inputs at the point of interest. Static slices are computed by finding consecutive sets of indirectly relevant statements, according to data and control dependencies.