Program slicing
Gallagher, K.
Binkley, D.
Comput. Sci. Dept., Univ. of Durham, Durham;
This paper appears in: Frontiers of Software Maintenance, 2008. FoSM 2008.
Publication Date: Sept. 28 2008-Oct. 4 2008
On page(s): 58-67
Location: Beijing,
ISBN: 978-1-4244-2654-6
INSPEC Accession Number: 10383563
Digital Object Identifier: 10.1109/FOSM.2008.4659249
Current Version Published: 2008-10-24
Abstract
Program slicing is a decomposition technique that slides program components not relevant to a chosen computation, referred to as a slicing criterion. The remaining components form an executable program called a slice that computes a projection of the original programpsilas semantics. Using examples coupled with fundamental principles, a tutorial introduction to program slicing is presented. Then applications of program slicing are surveyed, ranging from its first use as a debugging technique to current applications in property verification using finite state models. Finally, a summary of research challenges for the slicing community is discussed.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
