A formalisation of the relationship between forms of program slicing

  • Authors:

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

  • Affiliations:

  • Loyola College in Maryland, Baltimore, MD;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:
  • Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The widespread interest in program slicing within the source code analysis and manipulation community has led to the introduction of a large number of different forms of slicing. Each preserves some aspect of a program's behaviour and simplifies the program to focus exclusively upon this behaviour. In order to understand the similarities and differences between forms of slicing, a formal mechanism is required. This paper further develops a formal framework for comparing forms of slicing using a theory of program projection. This framework is used to reveal the ordering relationship between various static, dynamic, simultaneous and conditioned forms of slicing.