Theoretical foundations of dynamic program slicing

Dave Binkley, Sebastian Danicic, T. Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel

Research output: Contribution to journalArticle

31 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)23-41
Number of pages19
JournalTheoretical Computer Science
Volume360
Issue number1-3
DOIs
Publication statusPublished - Aug 21 2006

Fingerprint

Program Slicing
Slicing
Projection
Formulation

Keywords

  • Dynamic slicing
  • Program slicing

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Binkley, D., Danicic, S., Gyimóthy, T., Harman, M., Kiss, Á., & Korel, B. (2006). Theoretical foundations of dynamic program slicing. Theoretical Computer Science, 360(1-3), 23-41. https://doi.org/10.1016/j.tcs.2006.01.012

Theoretical foundations of dynamic program slicing. / Binkley, Dave; Danicic, Sebastian; Gyimóthy, T.; Harman, Mark; Kiss, Ákos; Korel, Bogdan.

In: Theoretical Computer Science, Vol. 360, No. 1-3, 21.08.2006, p. 23-41.

Research output: Contribution to journalArticle

Binkley, D, Danicic, S, Gyimóthy, T, Harman, M, Kiss, Á & Korel, B 2006, 'Theoretical foundations of dynamic program slicing', Theoretical Computer Science, vol. 360, no. 1-3, pp. 23-41. https://doi.org/10.1016/j.tcs.2006.01.012
Binkley, Dave ; Danicic, Sebastian ; Gyimóthy, T. ; Harman, Mark ; Kiss, Ákos ; Korel, Bogdan. / Theoretical foundations of dynamic program slicing. In: Theoretical Computer Science. 2006 ; Vol. 360, No. 1-3. pp. 23-41.
@article{93592c390e884d5bbdc89f174f86018c,
title = "Theoretical foundations of dynamic program slicing",
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.",
keywords = "Dynamic slicing, Program slicing",
author = "Dave Binkley and Sebastian Danicic and T. Gyim{\'o}thy and Mark Harman and {\'A}kos Kiss and Bogdan Korel",
year = "2006",
month = "8",
day = "21",
doi = "10.1016/j.tcs.2006.01.012",
language = "English",
volume = "360",
pages = "23--41",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Theoretical foundations of dynamic program slicing

AU - Binkley, Dave

AU - Danicic, Sebastian

AU - Gyimóthy, T.

AU - Harman, Mark

AU - Kiss, Ákos

AU - Korel, Bogdan

PY - 2006/8/21

Y1 - 2006/8/21

N2 - 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.

AB - 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.

KW - Dynamic slicing

KW - Program slicing

UR - http://www.scopus.com/inward/record.url?scp=33746635158&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746635158&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2006.01.012

DO - 10.1016/j.tcs.2006.01.012

M3 - Article

VL - 360

SP - 23

EP - 41

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -