International Journal of Advanced Research in Computer Science and Software Engineering (IJARCSSE)
The most difficult task a programmer faces is how to decompose a problem into a set of smaller and simpler sub-problems. Program slicing is a well-known program analytical technique that extracts the elements of a program related to particular computation. The conventional notion of a program slice is the set of all statements that might affect the value of a variable. Program slicing has been used for efficient program debugging activities, testing, program comprehension, restructuring, downsizing, and parallelizing. In this paper, the authors address different types of program slicing techniques by considering a very simple example. Program slice is computed by analyzing dependence relations between program statements. To compute program slices they have constructed intermediate structures of a program such as program dependence graph.