Skip to main content
Log in

Program slicing based on interesting index

  • Letters
  • Published:
Journal of Electronics (China)

Abstract

With the scale of programs becoming increasingly bigger, and the complexity degree higher, how to select program fragments for slicing has become an important research topic. A new type of criterion called interesting index is proposed for selecting parts of procedures or procedure fragments to do program slicing. This new criterion considers not only the subjective aspects in users, namely users’ emphasis on the time efficiency, storage capacity or readability, but also the objective aspect in large procedures. It also represents the benefit of the users, while displaying the many-faceted roles that program slicing plays. In this way users can proceed with program slicing to large systems or unfinished systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. M. Weiser, Program slicing, IEEE Trans. on Software Engineering, 16(1984)5, 498–509.

    Google Scholar 

  2. B. Li, G. Zheng, et al., An approach to analyzing and understanding program—program slicing, Journal of Computer Research & Development, 37(2000)3, 284–291, (in Chinese).

    Google Scholar 

  3. Z. Chen, B. Xu, Slicing object-oriented Java programs, ACM SIGPLAN Notices, 36(2001)4, 33–40.

    Article  Google Scholar 

  4. Z. Chen, B. Xu, An approach for analyzing dependence of concurrent programs, Journal of Computer Research & Development, 39(2002)2, 159–164, (in Chinese).

    Google Scholar 

  5. B. Xu, T. Zhang, et al., Dependence analysis of recursive subprograms and its applications, Journal of Computers, 24(2001)11, 1178–1184, (in Chinese).

    Google Scholar 

  6. J. Russell, Program slicing literature survey, December 2001, http://www.ece.utexas.edu/jrussell/seminar/slicing_survey.pdf.

  7. I. S. Chung, W. K. Lee, et al., Program slicing based on specification, Proceedings ACM 16th Symposium on Applied Computing, Las Vegas, Nevada, United States, 2001, 605–609.

  8. A. Beszedes, C. Farago, et al., Union slices for program maintenance, IEEE International Conference on Software Maintenance (ICSM’2002), Montreal, Quebec, Canada, October 3–6, 2002, 12–21.

  9. S. Kumar, et al., Better slicing of programs with jumps and switches, In Proceedings of Fundamental Approaches to Software Engineering (FASE’2002), Volume 2306 of LNCS, Springer, 2002, 96–112.

  10. A. De Lucia, M. Harman, et al., Unions of slices are not slices, Proceedings of the 7th European Conference on Software Maintenance and Reengineering (CSMR’2003), Benevento, Italy, March 26–28, 2003, 363–367.

  11. J. Chen, W. Liu, et al., Data Structure, Xuzhou, China University of Mining and Technology Press, 1996, (in Chinese).

    Google Scholar 

  12. Y. Zhou, B. Xu, An object-extracting approach using module cohesion, Journal of Software, 11(2000)4, 557–562.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

About this article

Cite this article

Wu, F., Yi, T. Program slicing based on interesting index. J. of Electron.(China) 21, 255–260 (2004). https://doi.org/10.1007/BF02687880

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02687880

Key words

Navigation