Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Slicing object-oriented software
Proceedings of the 18th international conference on Software engineering
Programmers use slices when debugging
Communications of the ACM
Forward Dynamic Object-Oriented Program Slicing
ASSET '99 Proceedings of the 1999 IEEE Symposium on Application - Specific Systems and Software Engineering and Technology
Slicing Objects Using System Dependence Graphs
ICSM '98 Proceedings of the International Conference on Software Maintenance
Distributed dynamic slicing of Java programs
Journal of Systems and Software
Computing dynamic slices of concurrent object-oriented programs
Information and Software Technology
Hi-index | 0.00 |
We propose a new dynamic slicing technique for object-oriented programs that is more efficient than the related algorithms. We use an extended system dependence graph (ESDG) as the intermediate program representation. Our dynamic slicing algorithm is based on marking and unmarking the edges in the ESDG as and when dependencies arise and cease during run-time.