Access Restriction

Author Barth, Jeffrey M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Incarnations ♦ Side effects ♦ Reference parameters ♦ Relations ♦ Data flow analysis ♦ Global flow analysis ♦ Optimization
Abstract A new interprocedural data flow analysis algorithm is presented and analyzed. The algorithm associates with each procedure in a program information about which variables may be modified, which may be used, and which are possibly preserved by a call on the procedure, and all of its subcalls. The algorithm is sufficiently powerful to be used on recursive programs and to deal with the sharing of variables which arises through reference parameters. The algorithm is unique in that it can compute all of this information in a single pass, not requiring a prepass to compute calling relationships or sharing patterns. The algorithm is asymptotically optimal in time complexity. It has been implemented and is practical even on programs which are quite large.
Description Affiliation: Stanford Univ., Stanford, CA (Barth, Jeffrey M.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 9
Page Count 13
Starting Page 724
Ending Page 736

Open content in new tab

   Open content in new tab
Source: ACM Digital Library