G. Agrawal and J. Saltz, Interprocedural partial redundancy elimination and its application to distributed memory compilation, International Conference o n P r ogramming Language Design and Implementation, pp.258-269, 1995.

F. E. Allen, Interprocedural data ow analysis, Proceedings of the IFIP Congress, pp.398-402, 1974.

B. Alpern, M. N. Wegman, and F. K. Zadeck, Detecting equality o f v ariables in programs, Symposium on Principles of Programming Languages, pp.1-11, 1988.

M. Alt and F. Martin, Generation of eecient interprocedural analyzers with PAG, Static Analysis Symposium, 1995.

C. Ancourt, F. Coelho, B. Creusillet, and R. Keryell, How to add a new phase in PIPS: The case of dead code elimination, Sixth International Workshop on Compilers for Parallel Computers, pp.19-30, 1996.

V. Balasundaram and K. Kennedy, A t e c hnique for summarizing data access and its use in parallelism enhancing transformations, International Conference o n P r ogramming Language Design and Implementation, pp.41-53, 1989.

J. Banning, An eecient w ay to nd the side eects of procedure calls and the aliases of variables, Symposium on Principles of Programming Languages, 1979.

S. Benkner, H. P. Brezany, and P. Zima, Processing array statements and procedure interfaces in the PREPARE high performance fortran compiler, International Conference on Compiler Construction, pp.324-338, 1994.
DOI : 10.1007/3-540-57877-3_22

D. Binkley, Interprocedural constant propagation using dependence graphs and a dataow model, International Conference on Compiler Construction, pp.374-388, 1994.

W. Blume and R. Eigenmann, Performance analysis pf parallelizing compilers on the Perfect Benchmarks programs, IEEE Transactions on Parallel and Distributed Systems, vol.3, issue.6, pp.643-656, 1992.
DOI : 10.1109/71.180621

W. Blume and R. Eigenmann, The range test, Proceedings of the 1994 ACM/IEEE conference on Supercomputing , Supercomputing '94, pp.528-537, 1994.
DOI : 10.1145/602770.602858

W. Blume and R. Eigenmann, Symbolic analysis techniques needed for the eeective parallelization of the Perfect Benchmarks, International Conference o n P a r allel Processing, pp.9-9

M. Burke, An interval-based approach to exhaustive and incremental interprocedural data-flow analysis, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.341-395, 1990.
DOI : 10.1145/78969.78963

M. Burke and R. Cytron, Interprocedural dependence analysis and parallelization, ACM SIGPLAN Symposium on Compiler Construction, pp.162-175, 1986.
DOI : 10.1145/12276.13328

M. Burke and L. Torczon, Interprocedural optimization: eliminating unnecessary recompilation, ACM Transactions on Programming Languages and Systems, vol.15, issue.3, pp.367-399, 1993.
DOI : 10.1145/169683.169678

C. Callahan, K. Cooper, K. Kennedy, and L. Torczon, Interprocedural constant propagation, ACM SIGPLAN Symposium on Compiler Construction, pp.152-161, 1986.
DOI : 10.1145/12276.13327
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7410

D. Callahan, The program summary graph and flow-sensitive interprocedual data flow analysis, International Conference on Programming Language Design and Implementation, pp.47-56, 1988.
DOI : 10.1145/960116.53995

D. Callahan, K. Cooper, R. Hood, K. Kennedy, and L. Torczon, ParaScope: A parallel programming environment, The International Journal of Supercomputer Applications, vol.2, issue.4, 1988.

D. Callahan and K. Kennedy, Analysis of interprocedural side effects in a parallel programming environment, Journal of Parallel and Distributed Computing, vol.5, issue.5, pp.517-550, 1988.
DOI : 10.1016/0743-7315(88)90011-1

P. Carini, Automatic inlining

P. Carini, Flow-sensitive interprocedural constant propagation, 1995.
DOI : 10.1145/223428.207113
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.3610

J. Choi, R. Cytron, and J. Ferrante, Automatic construction of sparse data ow evaluation graphs, Symposium on Principles of Programming Languages, pp.55-66, 1991.

F. Coelho, Compilation of I/O communications for HPF Available via http, Frontiers'95, 1995.

K. Cooper, M. Hall, R. Hood, K. Kennedy, K. Mckinley et al., The ParaScope parallel programming environment, Proceedings of the IEEE, 1993.
DOI : 10.1109/5.214549

K. Cooper, M. W. Hall, and K. Kennedy, Procedure cloning, Proceedings of the 1992 International Conference on Computer Languages, 1992.
DOI : 10.1109/ICCL.1992.185472

K. D. Cooper and K. Kennedy, EEcient computation of ow insensitive i n terprocedural summary information, ACM SIGPLAN Symposium on Compiler Construction, pp.247-258, 1984.

K. D. Cooper and K. Kennedy, Fast interprocedural alias analysis, Symposium on Principles of Programming Languages, pp.49-59, 1989.

B. Creusillet, Array Region Analyses and Applications Ecole des mines de Paris, 1996.

B. Creusillet and F. Irigoin, Interprocedural Array Region Analyses, International Journal of Parallel Programming, vol.2, issue.3, pp.513-546, 1996.
DOI : 10.1007/BF03356758
URL : https://hal.archives-ouvertes.fr/hal-00752611

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck, EEciently computing static single assignement form and the control dependence graph, Symposium on Principles of Programming Languages, pp.25-35, 1989.

E. Duesterwald, R. Gupta, and M. L. Sooa, Demand-driven computation of interprocedural data--ow, Symposium on Principles of Programming Languages, pp.37-48, 1995.

J. Ferrante, K. Ottenstein, and J. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems, vol.9, issue.3, pp.319-349, 1987.
DOI : 10.1145/24039.24041

S. Graham, S. Lucco, and O. Sharp, Orchestrating interactions among parallel computations, International Conference on Programming Language Design and Implementation, 1993.

D. Grove and L. Torczon, Interprocedural constant propagation: A study of jump functions implementations, International Conference on Programming Language Design and Implementation, pp.90-99, 1993.

J. Gu, Z. Li, and G. Lee, Symbolic array dataaow analysis for array privatization and program parallelization, Supercomputing, 1995.

J. Gu, Z. Li, and G. Lee, Experience with ecient d a t a o w analysis for array privatization, Symposium on Principles and Practice o f P a r allel Programming, pp.157-167, 1997.

R. Gupta, L. Pollock, and M. L. Sooa, Parallelizing data ow analysis, Workshop on Parallel Compilation, 1990.

M. Haghighat, Symbolic analysis for parallelizing compilers, ACM Transactions on Programming Languages and Systems, vol.18, issue.4, 1995.
DOI : 10.1145/233561.233568
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.6160

M. Hall, Managing Interprocedural Optimization, 1991.

M. Hall, S. Amarasinghe, B. Murphy, S. Liao, and M. Lam, Detecting coarsegrain parallelism using an interprocedural parallelizing compiler, Supercomputing, 1995.

M. Hall, J. Anderson, S. Amarasinghe, B. Murphy, S. Liao et al., Maximizing multiprocessor performance with the SUIF compiler, Computer, vol.29, issue.12, pp.2984-89, 1996.
DOI : 10.1109/2.546613

M. Hall, S. Hiranandani, K. Kennedy, and C. Tseng, Interprocedural Compilation of Fortran D, Journal of Parallel and Distributed Computing, vol.38, issue.2, pp.114-129, 1996.
DOI : 10.1006/jpdc.1996.0135

M. Hall and K. Kennedy, Efficient call graph analysis, ACM Letters on Programming Languages and Systems, vol.1, issue.3, pp.227-242, 1992.
DOI : 10.1145/151640.151643

M. Hall, J. Mellor-crummey, A. Carle, and R. Rodr-guez, FIAT: A framework for interprocedural analysis and transformation, Sixth International Workshop on Languages and Compilers for Parallel Computing, 1993.
DOI : 10.1007/3-540-57659-2_30

M. Hall, B. Murphy, S. Amarasinghe, S. Liao, and M. Lam, Interprocedural analysis for parallelization, Languages and Compilers for Parallel Computing, pp.61-80, 1995.
DOI : 10.1007/BFb0014192

M. J. Harrold and B. Malloy, A unified interprocedural program representation for a maintenance environment, IEEE Transactions on Software Engineering, vol.19, issue.6, pp.584-593, 1993.
DOI : 10.1109/32.232023

M. J. Harrold and M. L. Sooa, Efficient computation of interprocedural definition-use chains, ACM Transactions on Programming Languages and Systems, vol.16, issue.2, pp.175-204, 1994.
DOI : 10.1145/174662.174663

P. Havlak and K. Kennedy, An implementation of interprocedural bounded regular section analysis, IEEE Transactions on Parallel and Distributed Systems, vol.2, issue.3, pp.350-360, 1991.
DOI : 10.1109/71.86110

M. Hind, M. Burke, P. Carini, and S. Midkii, Interprocedural array analysis : How much precision do we n e e d ?, Third Workshop on Compilers for Parallel Computers, pp.48-64, 1992.

F. Irigoin, Interprocedural analyses for programming environments, Workshop on Environments and Tools for Parallel Scientiic Computing, 1992.

F. Irigoin, P. Jouvelot, and R. Triolet, Semantical interprocedural parallelization: An overview of the PIPS project, International Conference on Supercomputing, pp.144-151, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00984684

S. Johnson, M. Cross, and M. Everett, Exploitation of symbolic information in interprocedural dependence analysis, Parallel Computing, vol.22, issue.2, pp.197-226, 1996.
DOI : 10.1016/0167-8191(96)00002-6

W. Landi and B. Ryder, A safe approximation algorithm for interprocedural pointer aliasing, International Conference o n P r ogramming Language Design and Implementation, pp.235-248, 1992.

Y. Lee, B. Ryder, and M. Fiuczynski, Region analysis: a parallel elimination method for data ow analysis, IEEE Transactions on Software Engineering, vol.21, issue.11, pp.913-926, 1995.

Z. Li and P. Yew, EEcient interprocedural analysis and program parallelization and restructuring, Symposium on Parallel Processing: Experience with Applications, Languages and Systems, pp.85-99, 1988.
DOI : 10.1145/62115.62125

J. Loeliger and R. Metzger, Developing an interprocedural optimizing compiler, ACM SIGPLAN Notices, vol.29, issue.4, pp.41-48, 1994.
DOI : 10.1145/181761.181766

T. Marlowe and B. Ryder, An eecient h ybrid algorithm for incremental data ow analysis, Symposium on Principles of Programming Languages, pp.184-196, 1990.

T. Marlowe, B. Ryder, and M. Burke, Deening ow sensitivity i n d a t a ow problems, 1995.

D. Maydan, Accurate Analysis of Array References, 1992.

H. Mayer and M. Wolfe, Interprocedural alias analysis: Implementation and empirical results. Software : Practice and Experience, pp.1201-1233, 1993.
DOI : 10.1002/spe.4380231103
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9638

E. Morel and C. Renvoise, Interprocedural elimination of partial redundancies, Program Flow Analysis, 1981.

E. Myers, A precise inter-procedural data--ow algorithm, Symposium on Principles of Programming Languages, pp.219-230, 1981.

T. Nguyen, J. Gu, and Z. Li, An interprocedural parallelizing compiler and its support for memory hierarchy research, Languages and Compilers for Parallel Computing, pp.96-110, 1995.
DOI : 10.1007/BFb0014194

P. M. Petersen, Evaluation of Programs and Parallelizing Compilers using Dynamic Analysis Techniques, 1993.

A. Platonoo, Automatic data distribution for massively parallel computers, Fifth International Workshop on Compilers for Parallel Computers, pp.555-570, 1995.

C. Polychronopoulos, M. Girkar, M. Haghighat, C. Lee, B. Leung et al., PARAFRASE-2: AN ENVIRONMENT FOR PARALLELIZING, PARTITIONING, SYNCHRONIZING, AND SCHEDULING PROGRAMS ON MULTIPROCESSORS, International Conference on Parallel Processing, 1989.
DOI : 10.1142/S0129053389000044

T. Reps, Solving demand versions of interprocedural analysis problems, International Conference on Compiler Construction, pp.389-403, 1994.
DOI : 10.1007/3-540-57877-3_26

T. Reps, S. Horwitz, and M. Sagiv, Precise interprocedural dataaow analysis via graph reachability, Symposium on Principles of Programming Languages, pp.49-61, 1995.
DOI : 10.1145/199448.199462
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2004

B. Ryder, Constructing the Call Graph of a Program, IEEE Transactions on Software Engineering, vol.5, issue.3, pp.216-225, 1979.
DOI : 10.1109/TSE.1979.234183

V. Sarkar, PTRAN | the IBM parallel translation system, Parallel Functional Programming Languages and Compilers, pp.309-391, 1991.

M. Sharir and A. Pnuelli, Two approaches to interprocedural data ow analysis, Program Flow Analysis, pages 189{233, 1981.

K. Smith and W. Appelbe, PAT -an interactive Fortran parallelizing assistant t o o l, International Conference on Parallel Processing, pp.58-62, 1988.

V. Sreedhar, G. Gao, and Y. Lee, A new framework for exhaustive and incremental analysis using DJ graphs, International Conference o n P r ogramming Language Design and Implementation, pp.278-290, 1996.

E. Stoltz, M. Gelerk, and M. Wolfe, Extended SSA with factored use-def chains to support optimization and parallelism, Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94, pp.43-52, 1994.
DOI : 10.1109/HICSS.1994.323280

R. Triolet, P. , and F. Irigoin, Direct parallelization of call statements, ACM SIGPLAN Symposium on Compiler Construction, pp.176-185, 1986.

P. Tu, Automatic Array Privatization and Demand-Driven Symbolic Analysis, 1995.

K. Yi, W. Harrison, and I. , Automatic generation and management o f i n terprocedural program analyses, Symposium on Principles of Programming Languages, pp.246-259, 1993.