@article{(Open Science Index):https://publications.waset.org/pdf/15375,
	  title     = {An Efficient Algorithm for Computing all Program Forward Static Slices},
	  author    = {Jehad Al Dallal},
	  country	= {},
	  institution	= {},
	  abstract     = {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 program cohesion and parallelism, several
slices are computed at different program points. The existing
algorithms for computing program slices are introduced to compute a
slice at a program point. In these algorithms, the program, or the
model that represents the program, is traversed completely or
partially once. To compute more than one slice, the same algorithm
is applied for every point of interest in the program. Thus, the same
program, or program representation, is traversed several times.
In this paper, an algorithm is introduced to compute all forward
static slices of a computer program by traversing the program
representation graph once. Therefore, the introduced algorithm is
useful for software engineering applications that require computing
program slices at different points of a program. The program
representation graph used in this paper is called Program Dependence
Graph (PDG).},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {2},
	  number    = {4},
	  year      = {2008},
	  pages     = {1125 - 1128},
	  ee        = {https://publications.waset.org/pdf/15375},
	  url   	= {https://publications.waset.org/vol/16},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 16, 2008},
	}