|
 ABSTRACT
The global data relationships in a program can be exposed and codified by the static analysis methods described in this paper. A procedure is given which determines all the definitions which can possibly “reach” each node of the control flow graph of the program and all the definitions that are “live” on each edge of the graph. The procedure uses an “interval” ordered edge listing data structure and handles reducible and irreducible graphs indistinguishably.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
|
| |
4
|
Allen, F.E. A basis for program optimization. Proc. IFIP Congress. North-Holland Pub. Co., Amsterdam, 1971, pp. 385-390.
|
| |
5
|
|
| |
6
|
Allen, F.E. Interprocedural data flow analysis. Proc. IFIP Congress, North-Holland Pub. Co., Amsterdam, 1974, pp. 398-402; and IBM Research Rep. RC 4633, Thomas J. Watson Research Center, Yorktown Heights, N.Y., 1973.
|
| |
7
|
Allen, F.E., and Cocke, J. Graph theoretic constructs for program control flow analysis. IBM Research Report RC 3923, Thomas J. Watson Research Center, Yorktown Heights, N.Y., 1972.
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
Hecht, M.S., and Ullman, J.D. Flow graph reducibility. SIAM J. Computing 1, 2 (June 1972), 188-202.
|
| |
12
|
|
| |
13
|
Kam, J.B., and Ullman, J.D. Global optimization problems and iterative algorithms. TR-146, Computer Sci. Lab., Princeton U., Princeton, N.J., 1974.
|
| |
14
|
Kennedy, K. A global flow analysis algorithm. Internat. J. Computer Math. A 3 (1971), 5-15.
|
| |
15
|
Kennedy, K. A comparison of algorithms for global flow analysis. Tech. Rep. 476-093-1, Dep. of Mathematical Sciences, Rice U., Houston, Texas, 1974.
|
| |
16
|
|
| |
17
|
|
| |
18
|
Knuth, D.E. An empirical study of FORTRAN programs. Software-Practice and Experience 1, 2 (1971), 105-134.
|
| |
19
|
Kou, L.T. On live-dead analysis for global data flow problems. IBM Research Rep. RC 5278, Thomas J. Watson Research Center, Yorktown Heights, N.Y., 1975.
|
| |
20
|
|
CITED BY 87
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michael Burke , Ron Cytron , Jeanne Ferrante , Wilson Hsieh , Vivek Sarkar , David Shields, Automatic discovery of parallelism: a tool and an experiment (extended abstract), ACM SIGPLAN Notices, v.23 n.9, p.77-84, Sept. 1988
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yao-Wen Huang , Fang Yu , Christian Hang , Chung-Hung Tsai , Der-Tsai Lee , Sy-Yen Kuo, Securing web application code by static analysis and runtime protection, Proceedings of the 13th international conference on World Wide Web, May 17-20, 2004, New York, NY, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Chen Ding , Chengliang Zhang , Xipeng Shen , Mitsunori Ogihara, Gated memory control for memory monitoring, leak detection and garbage collection, Proceedings of the 2005 workshop on Memory system performance, June 12-12, 2005, Chicago, Illinois
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Xipeng Shen , Michael L. Scott , Chengliang Zhang , Sandhya Dwarkadas , Chen Ding , Mitsunori Ogihara, Analysis of input-dependent program behavior using active profiling, Proceedings of the 2007 workshop on Experimental computer science, p.5-es, June 13-14, 2007, San Diego, California
|
|
|
|
|
|
|
|
|
Xipeng Shen , Chengliang Zhang , Chen Ding , Michael L. Scott , Sandhya Dwarkadas , Mitsunori Ogihara, Analysis of input-dependent program behavior using active profiling, Experimental computer science on Experimental computer science, p.4-4, June 13-14, 2007, San Diego
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf