An efficient method for computing dynamic program slices
References (9)
- et al.
Dynamic program slicing
Inform. Process. Lett.
(1988) A survey of program slicing techniques
J. Programm. Languages
(1995)- et al.
Program slicing
Program slicing
IEEE Trans. Software Engrg.
(1984)
Cited by (14)
Distributed dynamic slicing of Java programs
2006, Journal of Systems and SoftwareAn efficient interprocedural dynamic slicing method
2006, Journal of Systems and SoftwareCitation 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.
Computing dynamic slices of concurrent object-oriented programs
2005, Information and Software TechnologyComputation of intraprocedural dynamic program slices
2003, Information and Software TechnologyCitation 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 2023Computing dynamic slices of feature-oriented programs with aspect-oriented extensions
2020, Informatica (Slovenia)