A novel approach for slicing of object oriented programs

Abstract

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.