PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Using Program Slicing in Software Maintenance
IEEE Transactions on Software Engineering
The use of program dependence graphs in software engineering
ICSE '92 Proceedings of the 14th international conference on Software engineering
Incremental program testing using program dependence graphs
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program and interface slicing for reverse engineering
ICSE '93 Proceedings of the 15th international conference on Software Engineering
Hybrid slicing: integrating dynamic information with static analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Call-mark slicing: an efficient and economical way of reducing slice
Proceedings of the 21st international conference on Software engineering
ICSE '81 Proceedings of the 5th international conference on Software engineering
Experimental Evaluation of Program Slicing for Fault Localization
Empirical Software Engineering
Distributed dynamic slicing of Java programs
Journal of Systems and Software
| Hi-index | 0.00 |
In this paper, we propose four slicing methods using both static and dynamic analysis information. (1) Statement-Mark Slice : removes the unnecessary statements using an execution history of the statements. (2) Partial Program Analysis : reduces the static analysis cost using invocation history of procedures. (3) Dynamic Data Dependence Analysis : extracts precise data dependence relations using dynamic data dependence analysis. (4) Array and Pointer Analysis : improves the efficiency of (3) by dynamically analyzing pointer and array variables only. Using both dynamic and static information, we will show that the precision of the slicing is improved with smaller run-time over-head.