Using Computing-All-Slices Algorithm in Measuring Functional Cohesion

J. Al Dallal (Kuwait)


Program slicing, static slicing, backward slicing, program dependence graph, cohesion measure.


Program slicing is the task of finding all statements in a program that directly, or indirectly, influence the value of a variable occurrence. The set of statements that can affect the value of a variable at some point in a program is called a program backward slice. In several software engineering applications, such as program debugging and measuring the program cohesion and parallelism, several slices are computed at different program points. Computing-All Slices algorithm computes all static slices of a program function by traversing the program representation graph once. The program representation graph used in this paper is called Program Dependence Graph (PDG). In this paper, we conduct an experimental comparison study using five software applications to show the effectiveness of the Computing-All-Slices algorithm in computing the functional cohesion of program functions. The effectiveness of the algorithm is measured in terms of the number of traversed PDG edges.

Important Links:

Go Back