{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T05:25:00Z","timestamp":1733462700831,"version":"3.30.1"},"reference-count":79,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0167-8191(98)00028-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:05:28Z","timestamp":1027641928000},"page":"629-648","source":"Crossref","is-referenced-by-count":1,"title":["Interprocedural analyses of Fortran programs"],"prefix":"10.1016","volume":"24","author":[{"given":"B","family":"Creusillet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F","family":"Irigoin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0167-8191(98)00028-3_BIB1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/71.180621","article-title":"Performance analysis of parallelizing compilers on the Perfect Benchmarks programs","volume":"3","author":"Blume","year":"1992","journal-title":"IEEE Trans. Parallel Distrib. Sys."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB2","unstructured":"P.M. Petersen, Evaluation of Programs and Parallelizing Compilers using Dynamic Analysis Techniques, PhD thesis, CSRD, University of Illinois, CSRD Report No. 1273, January 1993."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB3","unstructured":"F.E. Allen, Interprocedural data flow analysis, In Proceedings of the IFIP Congress, 1974, pp. 398\u2013402."},{"issue":"4","key":"10.1016\/S0167-8191(98)00028-3_BIB4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/181761.181766","article-title":"Developing an interprocedural optimizing compiler","volume":"29","author":"Loeliger","year":"1994","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB5","doi-asserted-by":"crossref","unstructured":"V. Sarkar, PTRAN\u2014the IBM parallel translation system, In Parallel Functional Programming Languages and Compilers, ACM Press Frontier Series, 1991, pp. 309\u2013391.","DOI":"10.1145\/107214.129260"},{"issue":"4","key":"10.1016\/S0167-8191(98)00028-3_BIB6","doi-asserted-by":"crossref","DOI":"10.1177\/109434208800200409","article-title":"ParaScope: A parallel programming environment","volume":"2","author":"Callahan","year":"1988","journal-title":"Int. J. Supercomput. Appl."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB7","doi-asserted-by":"crossref","unstructured":"C. Polychronopoulos, M. Girkar, M. Haghighat, C. Lee, B. Leung, D. Schouten. Parafrase-2: an environment for parallelizing, partitioning, synchronizing and scheduling programs on multiprocessors, In International Conference on Parallel Processing, August 1989.","DOI":"10.1142\/S0129053389000044"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB8","first-page":"58","article-title":"PAT\u2014an interactive Fortran parallelizing assistant tool","volume":"2","author":"Smith","year":"1988","journal-title":"Int. Conf. Parallel Processing"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB9","unstructured":"M. Hall, Managing Interprocedural Optimization. PhD thesis, Rice University, Houston, TX, April 1991."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB10","unstructured":"D. Maydan, Accurate Analysis of Array References, PhD thesis, Stanford University, September 1992."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB11","doi-asserted-by":"crossref","unstructured":"M. Burke, R. Cytron, Interprocedural dependence analysis and parallelization, In ACM SIGPLAN Symposium on Compiler Construction, 1986, pp. 162\u2013175.","DOI":"10.1145\/12276.13328"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB12","unstructured":"P. Carini, Automatic inlining, Research Report RC 10286, IBM, November 1995."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB13","doi-asserted-by":"crossref","unstructured":"K. Cooper, M.W. Hall, K. Kennedy, Procedure cloning, In IEEE International Conference on Computer Language, April 1992.","DOI":"10.1109\/ICCL.1992.185472"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB14","doi-asserted-by":"crossref","unstructured":"E. Myers, A precise interprocedural data-flow algorithm, In Symposium on Principles of Programming Languages, January 1981, pp. 219\u2013230.","DOI":"10.1145\/567532.567556"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB15","doi-asserted-by":"crossref","unstructured":"J. Banning, An efficient way to find the side effects of procedure calls and the aliases of variables, In Symposium on Principles of Programming Languages, January 1979.","DOI":"10.1145\/567752.567756"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB16","unstructured":"T. Marlowe, B. Ryder, M. Burke, Defining flow sensitivity in data-flow problems, Research Technical Report lcsr-tr-249, Rutgers University, Laboratory of Computer Science, July 1995."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB17","doi-asserted-by":"crossref","unstructured":"J. Choi, R. Cytron, J. Ferrante, Automatic construction of sparse data flow evaluation graphs, In Symposium on Principles of Programming Languages, January 1991, pp. 55\u201366.","DOI":"10.1145\/99583.99594"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB18","doi-asserted-by":"crossref","unstructured":"M. Hall, J. Mellor-Crummey, A. Carle, R. Rodr\u0131\u0301guez, FIAT: A framework for interprocedural analysis and transformation, In Sixth International Workshop on Languages and Compilers for Parallel Computing, August 1993.","DOI":"10.1007\/3-540-57659-2_30"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB19","doi-asserted-by":"crossref","unstructured":"K. Yi, W. Ludwell Harrison III, Automatic generation and management of interprocedural program analyses, In Symposium on Principles of Programming Languages, January 1993, pp. 246\u2013259.","DOI":"10.1145\/158511.158642"},{"issue":"6","key":"10.1016\/S0167-8191(98)00028-3_BIB20","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/32.232023","article-title":"A unified interprocedural program representation for a maintenance environment","volume":"19","author":"Harrold","year":"1993","journal-title":"IEEE Tran. Software Eng."},{"issue":"3","key":"10.1016\/S0167-8191(98)00028-3_BIB21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/151640.151643","article-title":"Efficient call graph analysis","volume":"1","author":"Hall","year":"1992","journal-title":"Lett. Program. Languages Sys."},{"issue":"3","key":"10.1016\/S0167-8191(98)00028-3_BIB22","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/TSE.1979.234183","article-title":"Constructing the call graph of a program","volume":"SE-5","author":"Ryder","year":"1979","journal-title":"IEEE Trans. Software Eng."},{"issue":"7","key":"10.1016\/S0167-8191(98)00028-3_BIB23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/960116.53995","article-title":"The program summary graph and flow-sensitive interprocedural data-flow analysis","volume":"23","author":"Callahan","year":"1988","journal-title":"Int. Conf. Program. Language Design Implementation ACM SIGPLAN Notices"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB24","doi-asserted-by":"crossref","unstructured":"D. Binkley, Interprocedural constant propagation using dependence graphs and a data-flow model, In International Conference on Compiler Construction, April 1994, pp. 374\u2013388.","DOI":"10.1007\/3-540-57877-3_25"},{"issue":"3","key":"10.1016\/S0167-8191(98)00028-3_BIB25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/24039.24041","article-title":"The program dependence graph and its use in optimization","volume":"9","author":"Ferrante","year":"1987","journal-title":"ACM Trans. Program. Languages Sys."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB26","doi-asserted-by":"crossref","unstructured":"B. Alpern, M.N. Wegman, F.K. Zadeck, Detecting equality of variables in programs, In Symposium on Principles of Programming Languages, January 1988, pp. 1\u201311.","DOI":"10.1145\/73560.73561"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB27","doi-asserted-by":"crossref","unstructured":"R. Cytron, J. Ferrante, B. Rosen, M. Wegman, K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, In Symposium on Principles of Programming Languages, January 1989, pp. 25\u201335.","DOI":"10.1145\/75277.75280"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB28","doi-asserted-by":"crossref","unstructured":"E. Stoltz, M. Gelerk, M. Wolfe, Extended SSA with factored use-def chains to support optimization and parallelism, In International Conference on System Sciences, 1994, pp. 43\u201352.","DOI":"10.1109\/HICSS.1994.323280"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB29","doi-asserted-by":"crossref","unstructured":"E. Duesterwald, R. Gupta, M.L. Sofia, Demand-driven computation of interprocedural data-flow, In Symposium on Principles of Programming Languages, January 1995, pp. 37\u201348.","DOI":"10.1145\/199448.199461"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB30","doi-asserted-by":"crossref","unstructured":"T. Reps, Solving demand versions of interprocedural analysis problems, In International Conference on Compiler Construction, April 1994, pp. 389\u2013403.","DOI":"10.1007\/3-540-57877-3_26"},{"issue":"3","key":"10.1016\/S0167-8191(98)00028-3_BIB31","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/78969.78963","article-title":"An interval-based approach to exhaustive and incremental interprocedural data-flow analysis","volume":"12","author":"Burke","year":"1990","journal-title":"ACM Trans. Program. Languages Sys."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB32","doi-asserted-by":"crossref","unstructured":"T. Marlowe, B. Ryder, An efficient hybrid algorithm for incremental data flow analysis, In Symposium on Principles of Programming Languages, January 1990, pp. 184\u2013196.","DOI":"10.1145\/96709.96728"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB33","doi-asserted-by":"crossref","unstructured":"V. Sreedhar, G. Gao, Y.-F. Lee, A new framework for exhaustive and incremental analysis using DJ graphs, In International Conference on Programming Language Design and Implementation, May 1996, pp. 278\u2013290.","DOI":"10.1145\/231379.231434"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB34","unstructured":"R. Gupta, L. Pollock, M.L. Soffa, Parallelizing data-flow analysis, In Workshop on Parallel Compilation, May 1990."},{"issue":"11","key":"10.1016\/S0167-8191(98)00028-3_BIB35","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/32.473220","article-title":"Region analysis: a parallel elimination method for data flow analysis","volume":"21","author":"Lee","year":"1995","journal-title":"IEEE Tran. Software Eng."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB36","doi-asserted-by":"crossref","unstructured":"W. Landi, B. Ryder, A safe approximation algorithm for interprocedural pointer aliasing, In International Conference on Programming Language Design and Implementation, 1992, pp. 235\u2013248.","DOI":"10.1145\/143103.143137"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB37","doi-asserted-by":"crossref","unstructured":"T. Reps, S. Horwitz and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability, In Symposium on Principles of Programming Languages, January 1995, pp. 49\u201361.","DOI":"10.1145\/199448.199462"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB38","unstructured":"M. Sharir, A. Pneulli. Two approaches to interprocedural data-flow analysis. In: S. Muchnick, N. Jones (Eds.), Program Flow Analysis, Prentice-Hall, 1981, pp. 189\u2013233."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB39","doi-asserted-by":"crossref","unstructured":"K.D. Cooper, K. Kennedy, Fast interprocedural alias analysis, In Symposium on Principles of Programming Languages, February 1989, pp. 49\u201359.","DOI":"10.1145\/75277.75282"},{"issue":"11","key":"10.1016\/S0167-8191(98)00028-3_BIB40","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1002\/spe.4380231103","article-title":"Interprocedural alias analysis: implementation and empirical results","volume":"23","author":"Mayer","year":"1993","journal-title":"Software Practice Experience"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB41","doi-asserted-by":"crossref","unstructured":"K.D. Cooper, K. Kennedy, Efficient computation of flow insensitive interprocedural summary information, In ACM SIGPLAN Symposium on Compiler Construction, June 1984, pp. 247\u2013258.","DOI":"10.1145\/502874.502898"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB42","unstructured":"E. Morel, C. Renvoise, Interprocedural elimination of partial redundancies, In: S. Muchnick, N. Jones (Eds.), Program Flow Analysis, Prentice-Hall, 1981."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB43","doi-asserted-by":"crossref","unstructured":"C. Callahan, K. Cooper, K. Kennedy, L. Torczon, Interprocedural constant propagation, In ACM SIGPLAN Symposium on Compiler Construction, 1986, pp. 152\u2013161.","DOI":"10.1145\/12276.13327"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB44","doi-asserted-by":"crossref","unstructured":"P. Carini, Flow-sensitive interprocedural constant propagation, Research Report RC 20290, IBM, November 1995.","DOI":"10.1145\/223428.207113"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB45","doi-asserted-by":"crossref","unstructured":"D. Grove, L. Torczon, Interprocedural constant propagation: A study of jump functions implementations, In International Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices, June 1993, pp. 90\u201399.","DOI":"10.1145\/155090.155099"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB46","unstructured":"M. Haghighat, Symbolic Analysis for Parallelizing Compilers, Kluwer Academic Publishers, 1995."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB47","doi-asserted-by":"crossref","unstructured":"M. Hall, B. Murphy, S. Amarasinghe, S.-W. Liao, M. Lam, Interprocedural analysis for parallelization, In Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science Springer-Verlag, August 1995, pp. 61\u201380.","DOI":"10.1007\/BFb0014192"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB48","doi-asserted-by":"crossref","unstructured":"W. Blume, R. Eigenmann, The range test: A dependence test for symbolic, nonlinear expressions, In International Conference on Supercomputing, 1994, pp. 528\u2013537.","DOI":"10.1145\/602770.602858"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB49","unstructured":"F. Irigoin, Interprocedural analyses for programming environments, In Workshop on Environments and Tools for Parallel Scientific Computing, North-Holland, September 1992, pp. 333\u2013350."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB50","doi-asserted-by":"crossref","unstructured":"F. Irigoin, P. Jouvelot, R. Triolet, Semantical interprocedural parallelization: An overview of the PIPS project, In International Conference on Supercomputing, June 1991, pp. 144\u2013151.","DOI":"10.1145\/109025.109086"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB51","doi-asserted-by":"crossref","unstructured":"R. Triolet, P. Feautrier, F. Irigoin, Direct parallelization of call statements, In ACM SIGPLAN Symposium on Compiler Construction, July 1986, pp. 176\u2013185.","DOI":"10.1145\/12276.13329"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB52","doi-asserted-by":"crossref","unstructured":"V. Balasundaram, K. Kennedy, A technique for summarizing data access and its use in parallelism enhancing transformations, In International Conference on Programming Language Design and Implementation, June 1989, pp. 41\u201353.","DOI":"10.1145\/73141.74822"},{"issue":"10","key":"10.1016\/S0167-8191(98)00028-3_BIB53","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/0743-7315(88)90011-1","article-title":"Analysis of interprocedural side effects in a parallel programming environment","volume":"5","author":"Callahan","year":"1988","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"10.1016\/S0167-8191(98)00028-3_BIB54","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/71.86110","article-title":"An implementation of interprocedural bounded regular section analysis","volume":"2","author":"Havlak","year":"1991","journal-title":"IEEE Tran. Parallel Distrib. Sys."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB55","doi-asserted-by":"crossref","unstructured":"Z. Li, P.-C. Yew. Efficient interprocedural analysis and program parallelization and restructuring, In Symposium on Parallel Processing: Experience with Applications, Languages and Systems, 1988, pp. 85\u201399.","DOI":"10.1145\/62115.62125"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB56","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(96)00002-6","article-title":"Exploitation of symbolic information in interprocedural dependence analysis","volume":"22","author":"Johnson","year":"1996","journal-title":"Parallel Comput."},{"issue":"6","key":"10.1016\/S0167-8191(98)00028-3_BIB57","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF03356758","article-title":"Interprocedural array region analyses","volume":"24","author":"Creusillet","year":"1996","journal-title":"Int. J. Parallel Program."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB58","doi-asserted-by":"crossref","unstructured":"J. Gu, Z. Li, G. Lee, Symbolic array data-flow analysis for array privatization and program parallelization, In Supercomputing, December 1995.","DOI":"10.1145\/224170.224318"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB59","doi-asserted-by":"crossref","unstructured":"M. Hall, S. Amarasinghe, B. Murphy, S.-W. Liao, M. Lam, Detecting coarse-grain parallelism using an interprocedural parallelizing compiler, In Supercomputing, December 1995.","DOI":"10.1145\/224170.224337"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB60","unstructured":"P. Tu, Automatic Array Privatization and Demand-Driven Symbolic Analysis, PhD thesis, University of Illinois at Urbana-Champaign, 1995."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB61","doi-asserted-by":"crossref","unstructured":"G. Agrawal, J. Saltz, Interprocedural partial redundancy elimination and its application to distributed memory compilation, In International Conference on Programming Language Design and Implementation, June 1995, pp. 258\u2013269.","DOI":"10.1145\/207110.207157"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB62","doi-asserted-by":"crossref","unstructured":"S. Benkner, H.P. Brezany, P. Zima, Processing array statements and procedure interfaces in the PREPARE High Performance Fortran compiler, In International Conference on Compiler Construction, Lecture Notes in Computer Science, April 1994, pp. 324\u2013338.","DOI":"10.1007\/3-540-57877-3_22"},{"issue":"2","key":"10.1016\/S0167-8191(98)00028-3_BIB63","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1006\/jpdc.1996.0135","article-title":"Interprocedural compilation of Fortran D","volume":"38","author":"Hall","year":"1996","journal-title":"J. Parallel Distrib. Comput."},{"issue":"12","key":"10.1016\/S0167-8191(98)00028-3_BIB64","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/2.546612","article-title":"Parallel programming with Polaris","volume":"29","author":"Blume","year":"1996","journal-title":"Computer"},{"issue":"12","key":"10.1016\/S0167-8191(98)00028-3_BIB65","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/2.546613","article-title":"Maximizing multiprocessor performance with the SUIF compiler","volume":"29","author":"Hall","year":"1996","journal-title":"Computer"},{"issue":"3","key":"10.1016\/S0167-8191(98)00028-3_BIB66","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/169683.169678","article-title":"Interprocedural optimization: eliminating unnecessary recompilation","volume":"15","author":"Burke","year":"1993","journal-title":"ACM Trans. Program. Languages Sys."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB67","unstructured":"American National Standard Institute, Programming Language FORTRAN, ANSI X3.9-1978, ISO 1539\u20131980, 1983."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB68","unstructured":"B. Creusillet, Array Region Analyses and Applications, PhD thesis, \u00c9cole des mines de Paris, Available at http:\/\/www.cri.ensmp.fr\/doc\/A-295.ps.gz., December 1996."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB69","doi-asserted-by":"crossref","unstructured":"F. Coelho, Compilation of I\/O communications for HPF, In Frontiers'95, available via http:\/\/www.cri.ensmp.fr\/~coelho, February 1995, pp. 102\u2013109.","DOI":"10.1109\/FMPC.1995.380458"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB70","unstructured":"A. Platonoff, Automatic data distribution for massively parallel computers, In Fifth International Workshop on Compilers for Parallel Computers, June 1995, pp. 555\u2013570."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB71","unstructured":"C. Ancourt, F. Coelho, B. Creusillet, R. Keryell, How to add a new phase in PIPS: The case of dead code elimination, In Sixth International Workshop on Compilers for Parallel Computers, December 1996, pp. 19\u201330."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB72","doi-asserted-by":"crossref","unstructured":"W. Blume, R. Eigenmann, Symbolic analysis techniques needed for the effective parallelization of the Perfect Benchmarks, In International Conference on Parallel Processing, 1994.","DOI":"10.1109\/ICPP.1994.59"},{"issue":"2","key":"10.1016\/S0167-8191(98)00028-3_BIB73","doi-asserted-by":"crossref","DOI":"10.1109\/5.214549","article-title":"The Parascope parallel programming environment","volume":"81","author":"Cooper","year":"1993","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB74","doi-asserted-by":"crossref","unstructured":"J. Gu, Z. Li, G. Lee, Experience with efficient data flow analysis for array privatization, In Symposium on Principles and Practice of Parallel Programming, June 1997, pp. 157\u2013167.","DOI":"10.1145\/263764.263785"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB75","doi-asserted-by":"crossref","unstructured":"T. Nguyen, J. Gu, Z. Li, An interprocedural parallelizing compiler and its support for memory hierarchy research, In Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, Springer-Verlag, August 1995, pp. 96\u2013110.","DOI":"10.1007\/BFb0014194"},{"issue":"2","key":"10.1016\/S0167-8191(98)00028-3_BIB76","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/174662.174663","article-title":"Efficient computation of interprocedural definition-use chains","volume":"16","author":"Harrold","year":"1994","journal-title":"ACM Tran. Program. Languages Sys."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB77","doi-asserted-by":"crossref","unstructured":"S. Graham, S. Lucco, O. Sharp, Orchestrating interactions among parallel computations, In International Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices, June 1993, pp. 100\u2013111.","DOI":"10.1145\/155090.155100"},{"key":"10.1016\/S0167-8191(98)00028-3_BIB78","unstructured":"M. Hind, M. Burke, P. Carini, S. Midkiff, Interprocedural array analysis: How much precision do we need? In Third Workshop on Compilers for Parallel Computers, July 1992, pp. 48\u201364."},{"key":"10.1016\/S0167-8191(98)00028-3_BIB79","doi-asserted-by":"crossref","unstructured":"M. Alt, F. Martin, Generation of efficient interprocedural analyzers with PAG, In Static Analysis Symposium, Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 33\u201350.","DOI":"10.1007\/3-540-60360-3_31"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T02:09:56Z","timestamp":1733450996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198000283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":79,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0167819198000283"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00028-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}