Abstract
This letter proposes a hybrid method for computing dynamic program slicing. The key element is to construct a Coverage-Testing-based Dynamic Dependence Graph (CTDDG), which makes use of both dynamic and static information to get execution status. The approach overcomes the limitations of previous dynamic slicing methods, which have to redo slicing if slice criterion changes.
This is a preview of subscription content, log in via an institution to check access.
References
M. Weiser, Program slicing, IEEE Trans. on Software Engineering, 16(1984)5, 498–509.
F. Tip, A survey of program slicing techniques, Journal of Programming Languages, 3(1995)3, 121–189.
B. Korel, J. Laski, Dynamic program slicing, Information Processing Letters, 29(1988)3, 155–163.
H. Agrawal, J. Horgan, Dynamic program slicing, Proceedings of the ACM SIGPLAN’90 Conference on Programming Language Design and Implementation, White Plains, New York, USA, ACM SIGPLAN Notices, 25(1990)6, 246–256.
G. Tibor, et al., An efficient relevant slicing method for debugging, Proceedings of the 7th European Engineering Conference held jointly with the 7th ACM SIGSOFT International Symposium on Foundations of Software Engineering, Toulouse, France, 1999, 303–321.
F. Wu, T. Yi, Dependence analysis for UML class diagrams, Journal of Electronics (China), 21(2004)3, 249–254.
F. Wu, T. Yi, Program slicing based on interesting index, Journal of Electronics (China), 21(2004)3, 255–260.
S. Horwitz, T. Reps, D. Binkley, Interprocedural slicing using dependence graphs, ACM Trans. on Programming Languages and Systems, 12(1990)1, 26–60.
Author information
Authors and Affiliations
Additional information
Communication author: Yi Tong, born in 1975, male, Ph.D. Center of Modern Education at Yichun University, Yichun 336000. China.
About this article
Cite this article
Yi, T., Wu, F. A hybrid dynamic program slicing. J. of Electron.(China) 22, 197–200 (2005). https://doi.org/10.1007/BF02688148
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02688148