DocumentCode :
3301674
Title :
Structured Dynamic Program Slicing
Author :
Zhang, Ruoyu ; Zheng, Yudi ; Huang, Shan ; Qi, Zhengwei
Author_Institution :
Sch. of Software, Shanghai Jiaotong Univ., Shanghai, China
fYear :
2011
fDate :
19-21 May 2011
Firstpage :
1
Lastpage :
4
Abstract :
Program slicing has been proven to be an effective approach to aid program understanding in recent years. A dynamic program slicer computes the set of instructions that may have affected or been affected by the given variable in certain location of the instruction stream. In this paper, we implement a dynamic forward slicer SPS which can extract the part of the code which is influenced by the user, and organize our result with the call graph of the program. Our experiments show that SPS has not only achieved high efficiency, but also provides clearer slicing results than traditional methods.
Keywords :
program debugging; program slicing; SPS; call graph; dynamic forward slicer; program debugging; program understanding; structured dynamic program slicing; Algorithm design and analysis; Computer languages; Debugging; Heuristic algorithms; Optimized production technology; Software; Software algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Management (CAMAN), 2011 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-9282-4
Type :
conf
DOI :
10.1109/CAMAN.2011.5778759
Filename :
5778759
Link To Document :
بازگشت