Precise dynamic slicing algorithms

  • Authors:

  • Xiangyu Zhang;Rajiv Gupta;Youtao Zhang

  • Affiliations:

  • The University of Arizona, Tucson, Arizona;The University of Arizona, Tucson, Arizona;The Univ. of Texas at Dallas, Richardson, TX

  • Venue:
  • Proceedings of the 25th International Conference on Software Engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dynamic slicing algorithms can greatly reduce the de bugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the design and evaluation of three precise dynamic slicing algorithms called the full preprocessing (FP), no preprocessing (NP) and limited preprocessing (LP) algorithms. The algorithms differ in the relative timing of constructing the dynamic data dependence graph and its traversal for computing requested dynamic slices. Our experiments show that the LP algorithm is a fast and practical precise slicing algorithm. In fact we show that while precise slices can be orders of magnitude smaller than imprecise dynamic slices, for small number of slicing requests, the LP algorithm is faster than an imprecise dynamic slicing algorithm proposed by Agrawal and Horgan.