Keywords
Computer programs
Abstract
Algorithms used to determine the control and data flow properties of computer programs are generally designed for one-time analysis of an entire new input. Application of such algorithms when the input is only slightly modified results in an inefficient system. In this theses a set of incremental update algorithms are presented for data flow analysis. These algorithms update the solution from a previous analysis to reflect changes in the program. Thus, extensive reanalysis to reflect changes in the program. Thus, extensive reanalysis of programs after each program modification can be avoided. The incremental update algorithms presented for global flow analysis are based on Hecht/Ullman iterative algorithms. Banning's interprocedural data flow analysis algorithms form the basis for the incremental interprocedural algorithms.
Notes
If this is your thesis or dissertation, and want to learn how to access it or for more information about readership statistics, contact us at STARS@ucf.edu
Graduation Date
1983
Advisor
Cottrell, Larry K.
Degree
Doctor of Philosophy (Ph.D.)
College
College of Arts and Sciences
Degree Program
Computer Science
Format
Pages
159 p.
Language
English
Rights
Public Domain
Length of Campus-only Access
None
Access Status
Doctoral Dissertation (Open Access)
Identifier
DP0014007
STARS Citation
Ghodssi, Vida, "Incremental Analysis of Programs" (1983). Retrospective Theses and Dissertations. 682.
https://stars.library.ucf.edu/rtd/682
Contributor (Linked data)
Accessibility Status
Searchable text