Slicing, Chopping, and Path Conditions with Barriers
Software Quality Control
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
An efficient interprocedural dynamic slicing method
Journal of Systems and Software
Slicing as a program transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dependence clusters in source code
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing dynamic slices of concurrent object-oriented programs
Information and Software Technology
Identification of extract method refactoring opportunities for the decomposition of methods
Journal of Systems and Software
A vocabulary of program slicing-based techniques
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
Many approaches to slicing rely upon the 'fact' that the union of two static slices is a valid slice. It is known that static slices constructed using program dependence graph algorithms are valid slices [19 ]. However, this is not true for other forms of slicing. For example, it has been estabished that the union of two dynamic slices is not necessarily a valid dynamic slice [8 ]. In this paper this result is extended to show that the union of two static slices is not necessarily a valid slice, based on Weiser's definition of a (static) slice.We also analyse the properties that make the union of different forms of slices a valid slice.