Comments on Program Slicing

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.

[1]  Mark Weiser,et al.  Program Slicing , 1981, IEEE Transactions on Software Engineering.

[2]  Mark Weiser,et al.  Reconstructing Sequential Behavior from Parallel Behavior Projections , 1983, Inf. Process. Lett..

[3]  Mark Weiser,et al.  Programmers use slices when debugging , 1982, CACM.

[4]  J. C. Huang,et al.  Detection of Data Flow Anomaly Through Program Instrumentation , 1979, IEEE Transactions on Software Engineering.

[5]  Bernard Carré,et al.  Information-flow and data-flow analysis of while-programs , 1985, TOPL.