Elsevier

Information Processing Letters

Volume 81, Issue 2, 31 January 2002, Pages 111-117
Information Processing Letters

An efficient method for computing dynamic program slices

https://doi.org/10.1016/S0020-0190(01)00202-2Get rights and content

Abstract

We propose an efficient method for computing dynamic slices of programs. Our method is based on construction of data dependence edges of program dependence graph at run-time. We introduce the concept of compact dynamic dependence graphs (CDDGs) of programs. We show computation of dynamic slices using CDDGs to be more efficient than existing methods.

References (9)

  • B. Korel et al.

    Dynamic program slicing

    Inform. Process. Lett.

    (1988)
  • F. Tip

    A survey of program slicing techniques

    J. Programm. Languages

    (1995)
  • D. Binkley et al.

    Program slicing

  • M. Weiser

    Program slicing

    IEEE Trans. Software Engrg.

    (1984)
There are more references available in the full text version of this article.

Cited by (14)

  • Distributed dynamic slicing of Java programs

    2006, Journal of Systems and Software
  • An efficient interprocedural dynamic slicing method

    2006, Journal of Systems and Software
    Citation Excerpt :

    Their intraprocedural edge-marking dynamic slicing algorithm requires at most O(n2) time to compute a dynamic slice after execution of a statement of interest. Mund et al. (2003) and Mund (2003) have shown that the dynamic slicing algorithm of Goswami and Mall (2002) may compute incorrect dynamic slices. Further, they have shown that the algorithms of Agrawal and Horgan may compute imprecise dynamic slices in the presence of do–while loops.

  • Computation of intraprocedural dynamic program slices

    2003, Information and Software Technology
    Citation Excerpt :

    The control and data dependences among nodes of the arranged paths are obtained by traversing backward along the sequence of paths. We present an example to show that the dynamic slicing algorithm of Goswami and Mall [40] may compute incorrect dynamic slices. That is, it may fail to include some statements that actually affect a slicing criterion.

  • Context Sensitive Dynamic Slicing of Multi-Agent System

    2023, 2023 IEEE 20th India Council International Conference, INDICON 2023
View all citing articles on Scopus
View full text