Automatic extraction of executable program subsets by simultaneous dynamic program slicing Export

@article{citeulike:3177454, abstract = {Developers of software product families and maintainers of ” legacy” software can benefit from the ability to automatically extract a correctly functioning subset of the code of a system that performs a desired subset of its behaviors. This article introduces a technique for automatic subsetting based on computing asimultaneous dynamic program slice of the code for a set of representative inputs. I show first why the naive approach (unioning traditional dynamic slices) fails, then give an abstract algorithm that succeeds in any slicing framework satisfying certain (mild) assumptions. Experiments using an implementation within the ISAT environment indicate that the algorithm consistently produces significantly smaller subsets than three competing approaches. I also discuss how to characterize the subset's correctness on inputs of interest outside the set used to compute the slice.}, author = {Hall, Robert J.}, citeulike-article-id = {3177454}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF00873408}, day = {1}, doi = {10.1007/BF00873408}, journal = {Automated Software Engineering}, keywords = {dynamic\_slicing}, month = {March}, number = {1}, pages = {33--53}, posted-at = {2008-09-01 05:35:11}, priority = {0}, title = {Automatic extraction of executable program subsets by simultaneous dynamic program slicing}, url = {http://dx.doi.org/10.1007/BF00873408}, volume = {2}, year = {1995} }

TY - JOUR ID - citeulike:3177454 L3 - citeulike-article-id:3177454 N2 - Developers of software product families and maintainers of “legacy” software can benefit from the ability to automatically extract a correctly functioning subset of the code of a system that performs a desired subset of its behaviors. This article introduces a technique for automatic subsetting based on computing asimultaneous dynamic program slice of the code for a set of representative inputs. I show first why the naive approach (unioning traditional dynamic slices) fails, then give an abstract algorithm that succeeds in any slicing framework satisfying certain (mild) assumptions. Experiments using an implementation within the ISAT environment indicate that the algorithm consistently produces significantly smaller subsets than three competing approaches. I also discuss how to characterize the subset's correctness on inputs of interest outside the set used to compute the slice. IS - 1 JF - Automated Software Engineering EP - 53 TI - Automatic extraction of executable program subsets by simultaneous dynamic program slicing VL - 2 SP - 33 KW - dynamic_slicing AU - Hall, Robert PY - 1995/03/01/ UR - http://dx.doi.org/10.1007/BF00873408 ER -