Downloads: 102
India | Computer Science Engineering | Volume 4 Issue 5, May 2015 | Pages: 3174 - 3177
Optimizing Dynamic Dependence Graph
Abstract: A dynamic dependence graph is one of many techniques to extract a dynamic slice. Dynamic program slicing is very useful in debugging. This paper discusses about brief comparison of static and dynamic slicing, the dynamic dependence graph and its optimization algorithm and conclusion.
Keywords: graph, dynamic slicing, program dependence graph, dynamic dependence graph, dependency matrix
Rating submitted successfully!
Received Comments
No approved comments available.