TY - JFULL
AU - Jehad Al Dallal
PY - 2008/1/
TI - Efficient Program Slicing Algorithms for Measuring Functional Cohesion and Parallelism
T2 - International Journal of Mathematical and Computational Sciences
SP - 903
EP - 911
VL - 2
SN - 1307-6892
UR - https://publications.waset.org/pdf/10757
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 24, 2008
N2 - 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 slice. In several software engineering applications, such as program debugging and measuring program cohesion and parallelism, several slices are computed at different program points. In this paper, algorithms are introduced to compute all backward and forward static slices of a computer program by traversing the program representation graph once. The program representation graph used in this paper is called Program Dependence Graph (PDG). We have conducted an experimental comparison study using 25 software modules to show the effectiveness of the introduced algorithm for computing all backward static slices over single-point slicing approaches in computing the parallelism and functional cohesion of program modules. The effectiveness of the algorithm is measured in terms of time execution and number of traversed PDG edges. The comparison study results indicate that using the introduced algorithm considerably saves the slicing time and effort required to measure module parallelism and functional cohesion.
ER -