Graph-less dynamic dependence-based dynamic slicing algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

Using Dynamic Dependence Graphs is a well understood method for computing dynamic program slices. However, in its basic form, the DDG is inappropriate for practical implementation, so several alternative approaches have been proposed by researchers. In this paper, we elaborate on different methods in which the execution trace is processed and, using local definition-use information, the dependence chains are followed "on the fly" to construct the slices without actually building any graphs. Naturally, various additional data structures still need to be maintained, but these vary on the slicing scenario. Firstly, one may want to perform the slicing in a demand-driven fashion, or to compute many slices globally. Next, one may be interested either in backward or forward slices. And finally, the slices can be produced by traversing the trace either in a forward or in a backward direction. This totals eight possibilities, of which some give useful algorithms, while there are irrelevant combinations as well. In this work we investigate all of them, give the basic algorithms where appropriate and discuss on implementation experiences and perspectives.

Original languageEnglish
Title of host publicationProceedings - Sixth IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006
Pages21-30
Number of pages10
DOIs
Publication statusPublished - Dec 1 2006
Event6th IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006 - Philadelphia, PA, United States
Duration: Sep 27 2006Sep 29 2006

Publication series

NameProceedings - Sixth IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006

Other

Other6th IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006
CountryUnited States
CityPhiladelphia, PA
Period9/27/069/29/06

    Fingerprint

Keywords

  • Dynamic slicing algorithms
  • Execution trace
  • Program dependences
  • Program slicing

ASJC Scopus subject areas

  • Software

Cite this

Beszédes, Á., Gergely, T., & Gyimóthy, T. (2006). Graph-less dynamic dependence-based dynamic slicing algorithms. In Proceedings - Sixth IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006 (pp. 21-30). [4026852] (Proceedings - Sixth IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006). https://doi.org/10.1109/SCAM.2006.17