DocumentCode
2578366
Title
A Very Efficient and Scalable Forward Static Slicing Approach
Author
Alomari, Hakam W. ; Collard, Michael L. ; Maletic, Jonathan I.
Author_Institution
Dept. of Comput. Sci., Kent State Univ., Kent, OH, USA
fYear
2012
fDate
15-18 Oct. 2012
Firstpage
425
Lastpage
434
Abstract
A highly efficient lightweight forward static slicing method is introduced. The method is implemented as a tool on top of srcML, an XML representation of source code. The approach does not compute the program dependence graph but instead dependency information is computed as needed while computing the slice on a variable. The result is a list of line numbers, dependent variables, aliases, and function calls that are part of the slice for a given variable. The tool produces the slice in this manner for all variables in a given system. The approach is highly scalable and can generate the slices for all variables of the Linux kernel in less than 13 minutes. Benchmark results are compared with the Code Surfer slicing tool and the approach compares well with regards to accuracy of slices.
Keywords
Linux; XML; operating system kernels; program slicing; CodeSurfer slicing tool; Linux kernel; XML representation; aliases; dependent variables; forward static slicing method; function calls; line numbers; program dependence graph; source code; srcML; Accuracy; Algorithm design and analysis; Benchmark testing; Dictionaries; Educational institutions; Syntactics; XML; impact analysis; minimal slice; program slicing; software maintenance;
fLanguage
English
Publisher
ieee
Conference_Titel
Reverse Engineering (WCRE), 2012 19th Working Conference on
Conference_Location
Kingston, ON
ISSN
1095-1350
Print_ISBN
978-1-4673-4536-1
Type
conf
DOI
10.1109/WCRE.2012.52
Filename
6385138
Link To Document