Skip to main content

Research Repository

Advanced Search

Stop-list Slicing

Gallagher, K.; Binkley, D.; Harman, M.; Di Penta, M.; Moonen, L.

Stop-list Slicing Thumbnail


Authors

K. Gallagher

D. Binkley

M. Harman

M. Di Penta

L. Moonen



Abstract

Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the slicing criterion: those variables that are not of interest. This third parameter is called the stoplist. When a variable in the stop-list is encountered, the data-flow dependence analysis of slicing is terminated for that variable. Stop-list slicing further focuses on the computation of interest, while ignoring computations known or determined to be uninteresting. This has the potential to reduce slice size when compared to traditional forms of slicing. In order to assess the size of the reduction obtained via stop-list slicing, the paper reports the results of three empirical evaluations: a large scale empirical study into the maximum slice size reduction that can be achieved when all program variables are on the stop-list; a study on a real program, to determine the reductions that could be obtained in a typical application; and qualitative case-based studies to illustrate stop-list slicing in the small. The large-scale study concerned a suite of 42 programs of approximately 800KLoc in total. Over 600K slices were computed. Using the maximal stoplist reduced the size of the computed slices by about one third on average. The typical program showed a slice size reduction of about one-quarter. The casebased studies indicate that the comprehension effects are worth further consideration.

Citation

Gallagher, K., Binkley, D., Harman, M., Di Penta, M., & Moonen, L. (2006, September). Stop-list Slicing. Presented at 6th IEEE International Workshop on Source Code and Analysis and Manipulation, SCAM'06., Philadelphia, PA, USA

Presentation Conference Type Conference Paper (published)
Conference Name 6th IEEE International Workshop on Source Code and Analysis and Manipulation, SCAM'06.
Start Date Sep 27, 2006
End Date Sep 29, 2006
Publication Date 2006-09
Deposit Date May 28, 2008
Publicly Available Date May 28, 2008
Publisher Institute of Electrical and Electronics Engineers
Pages 11-20
Book Title 6th IEEE International Workshop on Source Code Analysis and Manipulation, SCAM '06, 11-20 September 2006, Philadelphia USA ; proceedings.
DOI https://doi.org/10.1109/scam.2006.30
Public URL https://durham-repository.worktribe.com/output/1694660
Publisher URL http://doi.ieeecomputersociety.org/10.1109/SCAM.2006.30
Additional Information Conference dates: 27-29 September 2006.

Files

Published Conference Proceeding (134 Kb)
PDF

Copyright Statement
©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.





You might also like



Downloadable Citations