{"title":"An Efficient Algorithm for Computing all Program Forward Static Slices","authors":"Jehad Al Dallal","country":null,"institution":"","volume":16,"journal":"International Journal of Computer and Information Engineering","pagesStart":1125,"pagesEnd":1129,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/15375","abstract":"Program slicing is the task of finding all statements in\r\na program that directly or indirectly influence the value of a variable\r\noccurrence. The set of statements that can affect the value of a\r\nvariable at some point in a program is called a program backward\r\nslice. In several software engineering applications, such as program\r\ndebugging and measuring program cohesion and parallelism, several\r\nslices are computed at different program points. The existing\r\nalgorithms for computing program slices are introduced to compute a\r\nslice at a program point. In these algorithms, the program, or the\r\nmodel that represents the program, is traversed completely or\r\npartially once. To compute more than one slice, the same algorithm\r\nis applied for every point of interest in the program. Thus, the same\r\nprogram, or program representation, is traversed several times.\r\nIn this paper, an algorithm is introduced to compute all forward\r\nstatic slices of a computer program by traversing the program\r\nrepresentation graph once. Therefore, the introduced algorithm is\r\nuseful for software engineering applications that require computing\r\nprogram slices at different points of a program. The program\r\nrepresentation graph used in this paper is called Program Dependence\r\nGraph (PDG).","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 16, 2008"}