๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient method for computing dynamic program slices

โœ Scribed by D. Goswami; R. Mall


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
115 KB
Volume
81
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


Dynamic slicing of computer programs
โœ Bogdan Korel; Janusz Laski ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1016 KB