×

An efficient method for computing dynamic program slices. (English) Zbl 1032.68064

Summary: 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.

MSC:

68N99 Theory of software
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Tip, F., A survey of program slicing techniques, J. Programm. Languages, 3, 3, 121-189 (1995)
[2] Binkley, D.; Gallagher, K. B., Program slicing, (Zelkowitz, M., Advances in Computers, 43 (1996), Academic Press: Academic Press San Diego, CA)
[3] Weiser, M., Program slicing, IEEE Trans. Software Engrg., 10, 4, 352-357 (1984) · Zbl 0552.68004
[4] Ottenstein, K.; Ottenstein, L., The program dependence graph in software development environment, in: Proc. ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments. in: Proc. ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, SIGPLAN Notices, 19, 5, 177-184 (1984)
[5] Korel, B.; Laski, J., Dynamic program slicing, Inform. Process. Lett., 29, 3, 155-163 (1988) · Zbl 0656.68018
[6] Agrawal, H.; Horgan, J., Dynamic program slicing, in: Proc. ACM SIGPLAN’90 Conf. on Programming Language Design and Implementation. in: Proc. ACM SIGPLAN’90 Conf. on Programming Language Design and Implementation, SIGPLAN Notices, Analysis and Verification, 25, 6, 246-256 (1990)
[7] Agrawal, H.; DeMillo, R.; Spafford, E., Dynamic slicing in the presence of unconstrained pointers, (Proc. ACM 4th Symposium on Testing, Analysis and Verification, Victoria, BC (1991)), 60-73
[8] Mall, R., Fundamentals of Software Engineering (1999), Prentice-Hall: Prentice-Hall India
[9] Aho, A. V.; Sethi, R.; Ullman, J. D., Compilers: Principles, Techniques and Tools (1986), Addison-Wesley: Addison-Wesley Reading, MA
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.