Referenced Items are not available for this document.
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.
Published in:
Software Engineering, IEEE Transactions on
(Volume:SE-13
,
Issue:
12
)
Date of Publication: Dec. 1987
- Page(s):
- 1370 - 1371
- ISSN :
- 0098-5589
- Digital Object Identifier :
- 10.1109/TSE.1987.233147
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 18 September 2006
- Issue Date :
- Dec. 1987
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
