By Topic

An improved static program slicing algorithm using stack trace

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hongchang Zhang ; Sch. of Comput. Sci. & Technol., China Univ. of Min. & Technol., Xuzhou, China ; Shujuan Jiang ; Rong Jin

In order to improve the accuracy of the static program slicing which is used to locate the faults that cause an exception, we propose a new approach that uses the stack trace which is stored when an exception occurred. The proposed approach consists of three steps. First, it uses stack trace to infer the execution trace and figure out those methods and statements that have not been ever executed. Then, these methods which are not executed will be ignored when building the system dependence graph. Finally, the accurate slice will be got by adopting the improved program slicing algorithm. We perform an empirical study of our new approach by using four reported bugs of open-source project Ant. And the result shows that using our approach the slice is 8 percent less than using the general static program slicing algorithm on average.

Published in:

Software Engineering and Service Science (ICSESS), 2011 IEEE 2nd International Conference on

Date of Conference:

15-17 July 2011