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
• DOI: 10.1016/s0020-0190(01)00202-2

✦ 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.