Skip to main content
SpringerLink
Log in

Interprocedural constant range propagation and alias analysis by multiple version method

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A set of methods for interprocedural analysis is proposed. First, an approach for interprocedural constant propagation is given. Then the concept of constant propagation is extended so as to meet the needs of data dependence analysis. Besides certain constant, constant range can also be propagated. The related propagating rules are introduced, and an idea for computing Return function is given. This approach can solve almost all interprocedural constant propagation problems with non-recursive calls. Second, a multiple-version parallelizing technique is also proposed for alias problem. The work related to this paper has been implemented on a shared-memory parallel computer.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hans Zima, Barbara Chapman. Supercompilers for Parallel and Vector Computers. ACM Press, Addison-Wesley, 1991.

  2. David Callahan, Keith D. Cooper, Ken Kennedy, Linda Torezon. Interprocedural constant propagation.SIGPLAN Notices, 1986, 21(7): 152–161.

    Article  Google Scholar 

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

    Google Scholar 

  4. Burke M, Cytron R. Interprocedural dependence analysis and parallelization.SIGPLAN Notices, 1986, 21 (7): 162–175.

    Article  Google Scholar 

  5. Cooper K D, Kennedy K. Fast interprocedural alias analysis. InConf. Rec. 16-th ACM Symp. Principles of Programming Languages (POPL), 1989, pp. 49–59.

  6. Allen J R, Kennedy K. Automatic translation of FORTRAN: programs to vector form.ACM TOPLAS, 1987, 9: 491–542.

    Article  MATH  Google Scholar 

  7. Barth J M. A practical interprocedural data flow analysis algorithm.Comm. ACM, 1978, 21: 724–736.

    Article  Google Scholar 

  8. Allen F E. Interprocedural data flow analysis.Information Processing, 1974, 74: 398–402.

    Google Scholar 

  9. Kuck D J, Kuhn R H, Padua D A, Leasure B R, Wolfe M J. Dependence grapha and compiler optimization. InConf. Rec. 8th ACM Symp. Principles of Programming Languages (POPL), 1981, pp. 207–218.

  10. Perfect Benchmark, Technical Report, CSRD, University of Illinois at UC., 1991.

  11. Benchmark Routines, Computing Center, The Chinese Academy of Sciences, 1991.

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Technology, The Chinese Academy of Sciences, 100080, Beijing

    Fang Xianhong, Zhang Zhaoqing & Qiao Ruliang

Authors
  1. Fang Xianhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhang Zhaoqing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiao Ruliang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Fang Xianhong received his B.S. degree in computer science from The Changsha Institute of Technology in 1985, and his M.S. degree in computer science from Institute of Computing Technology (ICT), The Chinese Academy of Sciences in 1988. From 1988 to 1993, he worked at ICT as a practice engineer and a research assistant on compiler construction. He is currently a Ph.D. candidate in the Department of Computer Science at The University of Victoria, Canada. His research areas include software engineering and emphasizing software testing.

Zhang Zhaoqing graduated from Department of Mathematics, Peking University in 1960. She is a Professor of National Research Center for Intelligent Computing Systems (NCIC). Her research interests are in supercompiler and parallel programming environment.

Qiao Ruliang graduated from Department of Mathematics, Peking University in 1960. He is a Professor of NCIC. His research interests are in parallel computing technology and parallel programming tools.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fang, X., Zhang, Z. & Qiao, R. Interprocedural constant range propagation and alias analysis by multiple version method. J. of Comput. Sci. & Technol. 10, 403–416 (1995). https://doi.org/10.1007/BF02948336

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948336

Keywords

Search

Navigation