Software maintenance has always been one of the key activities in software engineering. Within software maintenance, program comprehension is the most critical part and thus is the most essential skill that any software engineer must have.
Program comprehension is achieved by many approaches. One popular approach is by program slicing. A program slicing is a decomposition technique that extracts statements relevant to a particular computation from a program. In this sense, a program slicer needs to have a slicing criterion to facilitate the extracting logics.
Program slices were originally introduced by Weiser and known as executable backward static slices. In this thesis, the foundation of program slicer is introduced and a backward program slicer is implemented effectively using a cross referencer and its lookup functions. The cross referencer is a data structure that stores the relationships among a program's statements by parsing program sources. The lookup functions are operations on this cross referencer data structure to retrieve desired information.
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 48/04M, Masters Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be