{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:10:15Z","timestamp":1737018615619,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693291"},{"type":"electronic","value":"9783540693307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-69330-7_27","type":"book-chapter","created":{"date-parts":[[2007,5,14]],"date-time":"2007-05-14T21:16:20Z","timestamp":1179177380000},"page":"397-412","source":"Crossref","is-referenced-by-count":1,"title":["Scalable Array SSA and Array Data Flow Analysis"],"prefix":"10.1007","author":[{"given":"Silvius","family":"Rus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guobin","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Rauchwerger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Ballance, R.A., Maccabe, A.B., Ottenstein, K.J.: The Program Dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In: ACM PLDI, White Plains, NY (1990)"},{"issue":"12","key":"27_CR2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/2.546612","volume":"29","author":"W. Blume","year":"1996","unstructured":"Blume, W., et al.: Advanced Program Restructuring for High-Performance Computers with Polaris. IEEE Computer\u00a029(12), 78\u201382 (1996)","journal-title":"IEEE Computer"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/78969.78963","volume":"12","author":"M. Burke","year":"1990","unstructured":"Burke, M.: An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM TOPLAS\u00a012(3), 341\u2013395 (1990)","journal-title":"ACM TOPLAS"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/3-540-18991-2_10","volume-title":"Supercomputing","author":"D. Callahan","year":"1988","unstructured":"Callahan, D., Kennedy, K.: Analysis of interprocedural side effects in a parallel programming environment. In: Houstis, E.N., Polychronopoulos, C.D., Papatheodorou, T.S. (eds.) ICS 1987. LNCS, vol.\u00a0297, pp. 138\u2013171. Springer, Heidelberg (1988)"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007633018973","volume":"29","author":"D.R. Chakrabarti","year":"2001","unstructured":"Chakrabarti, D.R., Banerjee, P.: Static single assignment form for messagepassing programs. Int. J. of Parallel Programming\u00a029(2), 139\u2013184 (2001)","journal-title":"Int. J. of Parallel Programming"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/3-540-48311-X_50","volume-title":"Euro-Par\u201999 Parallel Processing","author":"J.-F. Collard","year":"1999","unstructured":"Collard, J.-F.: Array SSA for explicitly parallel programs. In: Amestoy, P.R., Berger, P., Dayd\u00e9, M., Duff, I.S., Frayss\u00e9, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol.\u00a01685, p. 383. Springer, Heidelberg (1999)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/209936.209947","volume-title":"PPOPP 1995","author":"J.-F. Collard","year":"1995","unstructured":"Collard, J.-F., Barthou, D., Feautrier, P.: Fuzzy array dataflow analysis. In: PPOPP 1995, pp. 92\u2013101. ACM Press, New York (1995)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BFb0017247","volume-title":"Languages and Compilers for Parallel Computing","author":"B. Creusillet","year":"1997","unstructured":"Creusillet, B., Irigoin, F.: Exact vs. approximate array region analyses. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1996. LNCS, vol.\u00a01239, pp. 86\u2013100. Springer, Heidelberg (1997)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Cytron, R., et al.: An efficient method of computing static single assignment form. In: 16th ACM POPL, Austin, TX, January 1989, pp. 25\u201335 (1989)","DOI":"10.1145\/75277.75280"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of array and scalar references. Int. J. of Parallel Programming\u00a020(1), 23\u201354 (1991)","journal-title":"Int. J. of Parallel Programming"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/spe.4380200203","volume":"20","author":"T. Gross","year":"1990","unstructured":"Gross, T., Steenkiste, P.: Structured dataflow analysis for arrays and its use in an optimizing compilers. Software: Practice & Experience\u00a020(2), 133\u2013155 (1990)","journal-title":"Software: Practice & Experience"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/224170.224318","volume-title":"Supercomputing 1995","author":"J. Gu","year":"1995","unstructured":"Gu, J., Li, Z., Lee, G.: Symbolic array dataflow analysis for array privatization and program parallelization. In: Supercomputing 1995, p. 47. ACM Press, New York (1995)"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1145\/233561.233568","volume":"18","author":"M.R. Haghighat","year":"1996","unstructured":"Haghighat, M.R., Polychronopoulos, C.D.: Symbolic analysis for parallelizing compilers. ACM TOPLAS\u00a018(4), 477\u2013518 (1996)","journal-title":"ACM TOPLAS"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Hall, M.H., Amarasinghe, S.P., Murphy, B.R., Liao, S.-W., Lam, M.S.: Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. In: Supercomputing 1995, p. 49 (1995)","DOI":"10.1145\/224170.224337"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Knobe, K., Sarkar, V.: Array SSA form and its use in parallelization. In: ACM POPL, pp. 107\u2013120 (1998)","DOI":"10.1145\/268946.268956"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Maslov, V.: Lazy array data-flow dependence analysis. In: ACM POPL, Portland, OR, January 1994, pp. 311\u2013325 (1994)","DOI":"10.1145\/174675.177911"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Maydan, D.E., Amarasinghe, S.P., Lam, M.S.: Array data-flow analysis and its use in array privatization. In: ACM POPL, Charleston, SC, January 1993, pp. 2\u201315 (1993)","DOI":"10.1145\/158511.158515"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Moon, S., Hall, M.W., Murphy, B.R.: Predicated array data-flow analysis for run-time parallelization. In: ACM ICS, Melbourne, Australia, pp. 204\u2013211 (1988)","DOI":"10.1145\/277830.277874"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/509705.509708","volume":"24","author":"Y. Paek","year":"2002","unstructured":"Paek, Y., Hoeflinger, J., Padua, D.: Efficient and precise array access analysis. ACM TOPLAS\u00a024(1), 65\u2013109 (2002)","journal-title":"ACM TOPLAS"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-57659-2_31","volume-title":"Languages and Compilers for Parallel Computing","author":"W. Pugh","year":"1994","unstructured":"Pugh, W., Wonnacott, D.: An exact method for analysis of value-based array data dependences. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1993. LNCS, vol.\u00a0768, pp. 546\u2013566. Springer, Heidelberg (1994)"},{"key":"27_CR21","unstructured":"Pugh, W., Wonnacott, D.: Nonlinear array dependence analysis. UMIACS-TR- 94-123, Univ. of Maryland, College Park, MD, USA (1994)"},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1023\/A:1024597010150","volume":"31","author":"S. Rus","year":"2003","unstructured":"Rus, S., Hoeflinger, J., Rauchwerger, L.: Hybrid analysis: static & dynamic memory reference analysis. Int. J. of Parallel Programming\u00a031(3), 251\u2013283 (2003)","journal-title":"Int. J. of Parallel Programming"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-49727-7_3","volume-title":"Static Analysis","author":"V. Sarkar","year":"1998","unstructured":"Sarkar, V., Knobe, K.: Enabling sparse constant propagation of array elements via array SSA form. In: Levi, G. (ed.) SAS 1998. LNCS, vol.\u00a01503, pp. 33\u201356. Springer, Heidelberg (1998)"},{"key":"27_CR24","unstructured":"Schwartz, N.: Sparse constant propagation via memory classification analysis. TR1999-782, Dept. of Compute Science, Courant Institute, NYU (March 1999)"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Triolet, R., Irigoin, F., Feautrier, P.: Direct parallelization of Call statements. In: ACM 1986 Symp. on Comp. Constr., Palo Alto, CA, June 1986, pp. 175\u2013185 (1986)","DOI":"10.1145\/12276.13329"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Tu, P., Padua, D.: Gated SSA\u2013based demand-driven symbolic analysis for parallelizing compilers. In: 9th ACM ICS, Barcelona, Spain, July 1995, pp. 414\u2013423 (1995)","DOI":"10.1145\/224538.224648"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Languages and Compilers for Parallel Computing","author":"P. Tu","year":"1994","unstructured":"Tu, P., Padua, D.A.: Automatic array privatization. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1993. LNCS, vol.\u00a0768. Springer, Heidelberg (1994)"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Vanbroekhoven, P., Janssens, G., Bruynooghe, M., Corporaal, H., Catthoor, F.: Advanced copy propagation for arrays. In: LCTES 2003, New York, pp. 24\u201333 (2003)","DOI":"10.1145\/780732.780736"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-45574-4_7","volume-title":"Languages and Compilers for Parallel Computing","author":"D. Wonnacott","year":"2001","unstructured":"Wonnacott, D.: Extending scalar optimizations for arrays. In: Midkiff, S.P., Moreira, J.E., Gupta, M., Chatterjee, S., Ferrante, J., Prins, J.F., Pugh, B., Tseng, C.-W. (eds.) LCPC 2000. LNCS, vol.\u00a02017, pp. 97\u2013111. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69330-7_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T08:08:20Z","timestamp":1737014900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69330-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540693291","9783540693307"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69330-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}