Efficient Dynamic Object-Oriented Program Slicing

  • Park, Soon-Hyung (Dept. of Computer Science, Graduate School, PuKyong National Univ.) ;
  • Park, Man-Gon (Colombo Plan Staff College (Inter-Governmental International Organization), Dep. of Ed. Complex, Meralco Ave.)
  • Published : 2003.07.01

Abstract

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. We also propose an efficient slicing algorithm using the relations of relative tables in order to compute dynamic slices of object-oriented programs. Consequently, the efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional object-oriented dependence graphs and dynamic object-oriented program dependence graph.

Keywords