Using program slicing in software maintenance Export

@article{citeulike:3177448, abstract = {Program slicing is applied to the software maintenance problem by extending the notion of a program slice (that originally required both a variable and line number) to a decomposition slice, one that captures all computation on a given variable, i.e., is independent of line numbers. Using the lattice of single variable decomposition slices ordered by set inclusion, it is shown how a slice-based decomposition for programs can be formed. One can then delineate the effects of a proposed change by isolating those effects in a single component of the decomposition. This gives maintainers a straightforward technique for determining those statements and variables which may be modified in a component and those which may not. Using the decomposition, a set of principles to prohibit changes which will interfere with unmodified components is provided. These semantically consistent changes can then be merged back into the original program in linear time}, author = {Gallagher, K. B. and Lyle, J. R.}, booktitle = {Software Engineering, IEEE Transactions on}, citeulike-article-id = {3177448}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/32.83912}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=83912}, doi = {10.1109/32.83912}, journal = {Software Engineering, IEEE Transactions on}, keywords = {dynamic\_slicing}, number = {8}, pages = {751--761}, posted-at = {2008-09-01 05:31:42}, priority = {2}, title = {Using program slicing in software maintenance}, url = {http://dx.doi.org/10.1109/32.83912}, volume = {17}, year = {1991} }

TY - JOUR ID - citeulike:3177448 L3 - citeulike-article-id:3177448 N2 - Program slicing is applied to the software maintenance problem by extending the notion of a program slice (that originally required both a variable and line number) to a decomposition slice, one that captures all computation on a given variable, i.e., is independent of line numbers. Using the lattice of single variable decomposition slices ordered by set inclusion, it is shown how a slice-based decomposition for programs can be formed. One can then delineate the effects of a proposed change by isolating those effects in a single component of the decomposition. This gives maintainers a straightforward technique for determining those statements and variables which may be modified in a component and those which may not. Using the decomposition, a set of principles to prohibit changes which will interfere with unmodified components is provided. These semantically consistent changes can then be merged back into the original program in linear time IS - 8 JF - Software Engineering, IEEE Transactions on EP - 761 TI - Using program slicing in software maintenance VL - 17 T2 - Software Engineering, IEEE Transactions on SP - 751 KW - dynamic_slicing AU - Gallagher, KB AU - Lyle, JR PY - 1991/// UR - http://dx.doi.org/10.1109/32.83912 ER -