Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic slicing of computer programs
Journal of Systems and Software
Precise interprocedural dataflow analysis via graph reachability
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scenario-based design: envisioning work and technology in system development
Scenario-based design: envisioning work and technology in system development
Hybrid slicing: integrating dynamic information with static analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Call-mark slicing: an efficient and economical way of reducing slice
Proceedings of the 21st international conference on Software engineering
Dynamic Slicing Object-Oriented Programs for Debugging
SCAM '02 Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation
The Development and Evaluation of Three Diverse Techniques for Object-Oriented Code Inspection
IEEE Transactions on Software Engineering
Object-Oriented Software Engineering: A Use Case Driven Approach
Object-Oriented Software Engineering: A Use Case Driven Approach
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Hi-index | 0.00 |
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.