Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An extensible program representation for object-oriented software
ACM SIGPLAN Notices
Slicing object-oriented software
Proceedings of the 18th international conference on Software engineering
Selecting Regression Tests for Object-Oriented Software
ICSM '94 Proceedings of the International Conference on Software Maintenance
The program dependence graph in a software development environment
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Slicing Objects Using System Dependence Graphs
ICSM '98 Proceedings of the International Conference on Software Maintenance
Graph-Less Dynamic Dependence-Based Dynamic Slicing Algorithms
SCAM '06 Proceedings of the Sixth IEEE International Workshop on Source Code Analysis and Manipulation
Better Debugging via Output Tracing and Callstack-Sensitive Slicing
IEEE Transactions on Software Engineering
IFITA '10 Proceedings of the 2010 International Forum on Information Technology and Applications - Volume 01
| Hi-index | 0.00 |
This paper extends the graph-less technique proposed by Beszedes for slicing Object Oriented Programs. The proposed approach computes the dynamic slices of the OOPs, especially, in case of polymorphism. The approach generates the defined-used (d-u) chains of the objects and variables used in the program and computes the slice using the generated d-u chains; it then debugs the program by detecting the various possible bugs and generates messages suggesting that a bug may be present. A GUI tool has been developed to compute and display the computed slices. The tool allows the user to browse the program and see the generated advice.