Slicing object-oriented software

  • Authors:

  • Loren Larsen;Mary Jean Harrold

  • Affiliations:

  • IBM Corporation, Research Triangle Park, NC and Department of Computer Science, Clemson University;Department of Computer and Information Science, The Ohio State University, 395 Dreese Lab, 2015 Neil Avenue, Columbus OH and Department of Computer Science, Clemson University

  • Venue:
  • Proceedings of the 18th international conference on Software engineering
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Describes the construction of system dependence graphs for object-oriented software on which efficient slicing algorithms can be applied. We construct these system dependence graphs for individual classes, groups of interacting classes and complete object-oriented programs. For an incomplete system consisting of a single class or a number of interacting classes, we construct a procedure dependence graph that simulates all possible calls to public methods in the class. For a complete system, we construct a procedure dependence graph from the main program in the system. Using these system dependence graphs, we show how to compute slices for individual classes, groups of interacting classes and complete programs. One advantage of our approach is that the system dependence graphs can be constructed incrementally because representations of classes can be reused. Another advantage of our approach is that slices can be computed for incomplete object-oriented programs such as classes or class libraries. We present our results for C++, but our techniques can be applied to other statically typed object-oriented languages such as Ada-95.