Theoretical foundations of dynamic program slicing

  • Authors:
  • Dave Binkley;Sebastian Danicic;Tibor Gyimóthy;Mark Harman;Ákos Kiss;Bogdan Korel

  • Affiliations:
  • Loyola College in Maryland, Baltimore, Maryland;Goldsmiths College, University of London, New Cross, London, UK;Institute of Informatics, University of Szeged, Szeged, Hungary;King's College London, Strand, London, UK;Institute of Informatics, University of Szeged, Szeged, Hungary;Illinois Institute of Technology, Chicago, IL

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 5.23

Visualization

Abstract

This paper presents a theory of dynamic slicing, which reveals that the relationship between static and dynamic slicing is more subtle than previously thought. The definitions of dynamic slicing are formulated in terms of the projection theory of slicing. This shows that existing forms of dynamic slicing contain three orthogonal dimensions in their slicing criteria and allows for a lattice-theoretic study of the subsumption relationship between these dimensions and their relationship to static slicing formulations.