The Community for Technology Leaders
Green Image
Issue No. 12 - December (1987 vol. 13)
ISSN: 0098-5589
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.
slicing, Data flow analysis, debugging, information flow

H. Leung and H. Reghbati, "Comments on Program Slicing," in IEEE Transactions on Software Engineering, vol. 13, no. , pp. 1370-1371, 1987.
93 ms
(Ver 3.3 (11022016))