Interprocedural constant propagation using dependence graphs and a data-flow model-Reference-Cited by-同舟云学术

Interprocedural constant propagation using dependence graphs and a data-flow model

Published:1994 Issue: Volume: Page:374-388
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Binkley David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57877-3_25.pdf

Reference19 articles.

1. Aho, A.V., Sethi, R., and Ullman, J.D., Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA (1986).

2. Allen, R. and Kennedy, K., “Automatic translation of FORTRAN programs to vector form,” ACM Transactions on Programming Languages and Systems 9(4) pp. 491–542 (October 1987).

3. Banning, J.P., “An efficient way to find the side effects of procedure calls and the aliases of variables,” pp. 29–41 in Conference Record of the Sixth ACM Symposium on Principles of Programming Languages, (San Antonio, TX, Jan. 29–31, 1979), ACM, New York, NY (1979).

4. Barth, J.M., “A practical interprocedurai data flow analysis algorithm,” Commun. of the ACM 21(9) pp. 724–736 (September 1978).

5. Binkley, D., Horwitz, S., and Reps, T., “The multi-procedure equivalence theorem,” TR-890, Computer Sciences Department, University of Wisconsin, Madison, WI (November 1989).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Path-sensitive sparse analysis without path conditions;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18

2. Strategies for Source-to-Source Constant Propagation;Electronic Notes in Theoretical Computer Science;2002-12

3. Interprocedural analyses of Fortran programs;Parallel Computing;1998-05