Scenario oriented program slicing

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. One possible solution to such problem could be combining other program decomposition techniques together with program slicing. With such inspiration, this paper proposes a scenario oriented program slicing method to slice programs under specified execution scenarios. The scenarios provide a clear and easy understanding functional decomposition for the system, while the new slicing method can help figure out how a computation is implemented in a given scenario by effectively reducing the amount of code that a user needs to inspect.

References

1. G. Booch, J. Rumbaugh, and I. Jacobson. The unified modeling language user guide, Addison Wesley, 1999.
2. Z. Chen, B. Xu, W. Chu, H. Yang and J. Zhao. Slicing larger programs partially. In Proceedings of the International Conference on Software Engineering Research and Practice, 2003.
3. G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. Information and Software Technology Special Issue on Program Slicing, vol. 40, pp. 595--607, 1998.
4. J. M. Carroll. Scenario-based design: Envisioning work and technology in system development. Wiley, 1995.
5. A. Dunsmore, M. Roper, and M. Wood. The development and evaluation of three diverse techniques for object oriented code inspections. IEEE Transactions on Software Engineering, 29(8): 677--686, 2003.
6. J. Field, G. Ramalingam, and F. Tip. Parametric program slicing. In Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 379--392, 1995.
7. 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.
8. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependency graphs. ACM Transaction on Programming Languages and Systems, 22(1): 26--60, 1990.
9. I. Jacobson. Object oriented software engineering: A use case driven approach. Addison Wesley, 1992.
10. B. Korel and J. Laski. Dynamic slicing of computer programs. The Journal of Systems and Software 13(3): 187--195, 1990.
11. J. Krinke. Barrier slicing and chopping. In Proceedings of 3^rd IEEE International Workshop on Source Code Analysis and Manipulation, 2003.
12. A. Nishimatsu, M. Jihira, S. Kusumoto, and K. Inoue. Call-mark slicing: an efficient and economical way of reducing slice. In Proceedings of International Conference of Software Engineering, pp. 422--431, 1999.
13. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of ACM Symposium on Principles of Programming Languages, pp. 49--61, 1995.
14. F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3(3):121--189, 1995.
15. B. Xu, Z. Chen and H. Yang. Dynamic slicing object-oriented programs for debugging. In 2nd IEEE International Workshop on Source Code Analysis and Manipulation, 2002.
16. B. Xu, J. Qian, X. Zhang, Z. Wu, and L. Chen. A brief survey of program slicing. ACM SIGSOFT Software Engineering Notes, 30(2):10--45, 2005.
17. Soot. http://www.sable.mcgill.ca/soot/
18. AmaterasUML. http://amateras.sourceforge.jp
19. Eclipse JDT. http://www.eclipse.org/jdt/

Index Terms

• Software and its engineering

  • Software creation and management

    • Designing software

      • Software implementation planning

        • Software design techniques

    • Software development process management

      • Software development methods