This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1987 (vol. 13 no. 12)
pp. 1370-1371
H.K.N. Leung, Department of Computer Science, University of Alberta
This correspondence points out some of the problems with Weiser's algorithm [5] for computing program slices. Corrections are made to Weiser's algorithm. It is shown how Weiser's algorithm can be amended to handle loops. Advantages of the Bergeretti and Carre's approach [1] are discussed.
Index Terms:
slicing, Data flow analysis, debugging, information flow
Citation:
H.K.N. Leung, H.K. Reghbati, "Comments on Program Slicing," IEEE Transactions on Software Engineering, vol. 13, no. 12, pp. 1370-1371, Dec. 1987, doi:10.1109/TSE.1987.233147
Usage of this product signifies your acceptance of the Terms of Use.