skip to main content
10.1145/302405.302674acmconferencesArticle/Chapter ViewAbstractPublication PagesicseConference Proceedingsconference-collections
Article
Free Access

Call-mark slicing: an efficient and economical way of reducing slice

Authors Info & Claims
Published:16 May 1999Publication History
First page image

References

  1. 1.agrawal, H., and Horgan, J.: "bynamic Program Slicing", SIGPLAN Notices, Vol.25, No.6, pp. 246- 256 (1990) . Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Agrawal, H., Demillo, R. A., and Spafford, E. H. : "Debugging with Dynamic Slicing and Backtracking", Software Practice and Experience, Vol. 23, No. 6, pp. 589-616 (1993). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Aho, A. V., Sethi, R., and Ullman, J. D.: "Compilers: Principles, Techniques, and Tools", Addison Wesley, Massachusetts, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Field, J., and Ramalingam, G.: "Parametric Program Slicing", Proc. of ddnd ACM Symposium on Principles of Programming Languages, pp. 379- 392, San Francisco, USA, January (1995). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Atkinson, D. C. and Griswold, W. G. : "The Design of Whole-Program Analysis Tools", Proceedings of the 18th International Conference on Software Engineering, pp. 16-27, Berlin, Germany, March (1996). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Guputa,R., and Soffa, M. L. : '<Hybrid Slicing: An Approach for Refining Static Slices Using Dynamic Information", Proceedings of the 3rd International Symposium on the Foundation of Software Engineering, pp. 29-40, October (1995). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Harrold, M. J., and Ci, N. : 'LReuse-Driven Interprocedural Slicing", Proceedings of the 20th International Conference on Software Engineen'ng, pp. 74-83, Kyoto, Japan, April (1998). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Horwitz, S. and Reps, T.: "The Use of Program Dependence Graphs in Software Engineering", Proceedings of the 14th International Conference on software Engineering, pp. 392-411(1992). Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Korel, B., and Laski, 'J. : "Dynamic Program Slicing", Information Processing Letters, Vol.29, No,lO, pp. 155-163 (1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.orel, B., and Laski, J. : '<Dynamic Slicing of Computer Programs", Journal of Systems Software, Vol.13, pp. 187-195 (1990). Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Murphy, G. C., and Notkin, D.: "Lightweight Lexical Source Model Extraction", ACM Transactions on Softvlare Engineering and Methodology, Vol. 5, No. 3, pp. 262-292, July (1996). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Ning, J. Q., Engberts, A., Kozaczynski, W. V. : "Automated Support for Legacy Code Understanding", Communications of the ACM, Vol. 37, No. 5, pp.50-57, May (1994). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Nishimatsu, A., Kusumoto, S., Inoue, K. : "An Experimental Evaluation of Program Slicing on Fault Localization Process", Technical Report of IEICE Japan, SS98-3, pp. 17-24, (1998)(in Japanese).Google ScholarGoogle Scholar
  14. 14.Sato, S., Iida, H., and Inoue, K. : 'Software Debug Supporting Tool Based on Program Dependence Analysis", Transaction on IPSJ, Vol. 37, No. 4, pp. 536-545 (1996) (in Japanese).Google ScholarGoogle Scholar
  15. 15.Ueda, R., Inoue, K., and Iida, H. : "A Practical Slice Algorithm for Recursive Programs", Proceedings of the International Symposium on Software Engineering for the Next Generation, pp. 96-106, Nagoya, Japan, February (1996).Google ScholarGoogle Scholar
  16. 16.Vengatesh, G. A., and Fischer, C. N. : 'SPARE: A Development Environment for Program Analysis Algorithms", IEEE Z%ans. on Sofiware Engineering, Vol. 18, No. 4, pp.304315, April (1992). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.Weiser, M.: "Program Slicing", Proceedings of the Fifth International Conference on Software Engineering, pp. 439-449 (1981). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Call-mark slicing: an efficient and economical way of reducing slice

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  cover image ACM Conferences
                  ICSE '99: Proceedings of the 21st international conference on Software engineering
                  May 1999
                  741 pages
                  ISBN:1581130740
                  DOI:10.1145/302405

                  Copyright © 1999 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 16 May 1999

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  Overall Acceptance Rate276of1,856submissions,15%

                  Upcoming Conference

                  ICSE 2025

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader