skip to main content
research-article

Program slicing under UML scenario models

Published:01 February 2008Publication History
Skip Abstract Section

Abstract

Slicing is an important decomposition technique for program understanding. However, traditional slicing methods tend to produce too large slices for human inspection as modern programs are often huge and static program analyses are hard to be precise enough. According to the state-of-the art research and our own experience, we believe a possible solution to such problem could be incorporating UML scenario models into program slicing. This paper presents a detail discussion on how scenarios can benefit slicing relevant program analyses and proposes a general scenario specified program slicing method. The analyses indicate that scenario specified program slicing may obtain smaller slices for program understanding.

References

  1. G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison Wesley, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. G. Canfora, A. Cimitile, and A. De Lucia. Conditioned Program Slicing. Information and Software Technology, Special Issue on Program Slicing, Vol. 40, pages 595--607, 1998.Google ScholarGoogle Scholar
  3. A. De Lucia, A. R. Fasolino, and M. Munro. Understanding Function Behaviors through Program Slicing. In Proceedings of 4th Workshop on Program Comprehension, pages 9--18, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Field, G. Ramalingam, and F. Tip. Parametric Program Slicing. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 379--392, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Gupta, M. L. Soffa, and J. Howard. Hybrid Slicing: Integrating Dynamic Information with Static Analysis. ACM Transactions on Software Engineering and Methodology, 6(4): 370--397, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Hind. Pointer Analysis: Haven't We Solved This Problem Yet?. In Program Analysis for Software Tools and Engineering, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. I. Jacobson. Object Oriented Software Engineering: A Use Case Driven Approach. Addison Wesley, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. B. Korel and J. Laski. Dynamic Slicing of Computer Programs. The Journal of Systems and Software 13(3): 187--195, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Mock, D. C. Atkinson, C. Chambers, and S. J. Eggers, Program Slicing with Dynamic Points-to Sets, IEEE Transaction on Software Engineering, 31(8): 657--678, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Nishimatsu, M. Jihira, S. Kusumoto, and K. Inoue. Call-mark Slicing: An Efficient and Economical Way of Reducing Slice. In Proceedings of the International Conference of Software Engineering, pages 422--431, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Rilling and B. Karanth. A Hybrid Program Slicing Framework. In International Workshop on Source Code Analysis and Manipulation, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  12. T. Takada, F. Ohata, and K. Inoue. Dependence-Cache Slicing: A Program Slicing Method Using Light-Weight Dynamic Information. In Proceedings of the 10th International Workshop on Program Comprehension, pages 169--178, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. F. Tip. A Survey of Program Slicing Techniques. Journal of Programming Languages, 3(3):121--189, 1995.Google ScholarGoogle Scholar
  14. P. Tonella and A. Potrich. Reverse Engineering of the Interaction Diagrams from C++ Code. In Proceedings of the International Conference on Software Maintenance, page 159, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G. A. Venkatesh. The Semantic Approach to Program Slicing. Proceedings of the ACM Conference on Programming language design and implementation, pages 107--119, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Baowen Xu, Ju Qian, Xiaofang Zhang, Zhongqiang Wu, and Lin Chen. A Brief Survey of Program Slicing. ACM SIGSOFT Software Engineering Notes, 30(2):10--45, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Program slicing under UML scenario models

          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

          Full Access

          • Published in

            cover image ACM SIGPLAN Notices
            ACM SIGPLAN Notices  Volume 43, Issue 2
            February 2008
            30 pages
            ISSN:0362-1340
            EISSN:1558-1160
            DOI:10.1145/1361213
            Issue’s Table of Contents

            Copyright © 2008 Author

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 1 February 2008

            Check for updates

            Qualifiers

            • research-article
          • Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!