Research Paper | Computer Science & Engineering | India | Volume 4 Issue 5, May 2015
Optimizing Dynamic Dependence Graph
Toshi Sharma, Madhuri Sharma
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
Edition: Volume 4 Issue 5, May 2015,
Pages: 3174 - 3177
How to Cite this Article?
Toshi Sharma, Madhuri Sharma, "Optimizing Dynamic Dependence Graph", International Journal of Science and Research (IJSR), https://www.ijsr.net/get_abstract.php?paper_id=SUB1549191, Volume 4 Issue 5, May 2015, 3174 - 3177
How to Share this Article?
Similar Articles with Keyword 'graph'
Joining Delay; Packet Delivery and Limitations of EGMP
G. Anandhi, Dr. S. K. Srivatsa
A Study and Comparative Analysis of Cryptographic Algorithms for Various File Formats
M. Meena, A. Komathi