Skip to Main Content
This correspondence points out some of the problems with Weiser's algorithm  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  are discussed.
Date of Publication: Dec. 1987