Comments on Program Slicing

Authors:
Hareton K. N. Leung;Hassan K. Reghbati
Affiliations:
Univ. of Alberta, Edmonton, Alta, Canada;Univ. of British Columbia, Vancouver, B.C., Canada
Venue:
IEEE Transactions on Software Engineering
Year:
1987

Citing 0
Cited 3

Beyond traditional program slicing

ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Difficulties in Integrating Multiview Development Systems

IEEE Software
A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.