A Precise and Efficient Algorithm for Determining Existential Summary Data Flow Information,
Abstract
Data flow analysis is well understood at the intra-procedural level and efficient algorithms are available. When inter-procedural mechanisms such as recursion, procedure nesting, and pass-by-reference parameters are introduced, the data flow problems become more difficult. Let ISIZE be the size of the problem and OSIZE be the size of the resulting data flow relation. A O(ISIZE+OSIZE) algorithm is demonstrated for the existential summary data flow problem. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1980
- Accession Number
- ADA089195
Entities
People
- Eugene W. Myers
Organizations
- University of Colorado Boulder