{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:56:43Z","timestamp":1794337003005,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540607656","type":"print"},{"value":"9783540494461","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0014188","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T03:13:46Z","timestamp":1132715626000},"page":"1-15","source":"Crossref","is-referenced-by-count":8,"title":["Array data flow analysis for load-store optimizations in superscalar architectures"],"prefix":"10.1007","author":[{"given":"Rastislav","family":"Bod\u00edk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"M.E. Benitez and J.W. Davidson, \u201cCode Generation for Streaming: an Access\/Execute Mechanism,\u201d Proceedings of Arch. Support for Programming Languages and Operating Systems-IV, pages 132\u2013141, 1991.","DOI":"10.1145\/106974.106987"},{"key":"1_CR2","unstructured":"R. Bodik and R. Gupta, \u201cOptimal Placement of Load-Store Operations for Array Accesses in Loops,\u201d Technical report 95-03, DCS, Univ. of Pittsburgh, 1995."},{"key":"1_CR3","first-page":"53","volume-title":"Improving Register Allocation for Subscripted Variables","author":"D. Callahan","year":"1990","unstructured":"D. Callahan, S. Carr, and K. Kennedy, \u201cImproving Register Allocation for Subscripted Variables,\u201d Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, White Plains, New York, pages 53\u201365, June 1990."},{"issue":"No.1","key":"1_CR4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/spe.4380240104","volume":"24","author":"S. Carr","year":"1994","unstructured":"S. Carr and K. Kennedy, \u201cScalar Replacement in the Presence of Conditional Control Flow,\u201d Software-Practice and Experience, Vol. 24, No. 1, pages 51\u201377, Jan. 1994.","journal-title":"Software-Practice and Experience"},{"issue":"no.6","key":"1_CR5","first-page":"98","volume":"17","author":"G.J. Chaitin","year":"1982","unstructured":"G.J. Chaitin, \u201cRegister Allocation and Spilling via Graph Coloring,\u201d Proceedings of the SIGPLAN Symposium on Compiler Construction, SIGPLAN Notices, vol. 17, no. 6, pages 98\u2013105, June 1982.","journal-title":"SIGPLAN Notices"},{"key":"1_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, Massachusetts, 1990."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"J.C. Dehnert, P.Y.-T. Hsu, and J.P. Bratt, \u201cOverlapped Loop Support in the Cydra 5,\u201d Proceedings of ASPLOS-III, pages 26\u201339, 1989.","DOI":"10.1145\/70082.68185"},{"issue":"No.2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/103135.214520","volume":"13","author":"D.M. Dhamdhere","year":"1991","unstructured":"D.M. Dhamdhere, \u201cPractical Adaptation of the Global Optimization Algorithm of Morel and Renvoise,\u201d ACM Transactions on Programming Languages and Systems, Volume 13, No. 2, pages 291\u2013294, April 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"D.M. Dhamdhere, B.K. Rosen and F.K. Zadeck, \u201cHow to Analyze Large Programs Efficiently and informatively,\u201d Proc. of the SIGPLAN PLDI, San Francisco, California, pages 212\u2013223, June 1992.","DOI":"10.1145\/143095.143135"},{"key":"1_CR10","first-page":"192","volume-title":"LNCS 641","author":"E. Duesterwald","year":"1992","unstructured":"E. Duesterwald, R. Gupta, and M.L. Soffa, \u201cRegister Pipelining: An Integrated Approach to Register Allocation for Scalar and Subscripted Variables,\u201d Proc. of International Workshop on Compiler Construction, LNCS 641 Springer Verlag, pages 192\u2013206, Paderborn, Germany, October 1992."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"E. Duesterwald, R. Gupta, and M.L. Soffa, \u201cA Practical Data Flow Framework for Array Reference Analysis and its Application in Optimizations,\u201d Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.68\u201377, Albuquerque, New Mexico, June 1993.","DOI":"10.1145\/155090.155097"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"R. Gupta, \u201cGeneralized Dominators and Post-Dominators,\u201d The Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 246\u2013257, Albuquerque, New Mexico, January 1992.","DOI":"10.1145\/143165.143216"},{"key":"1_CR13","first-page":"176","volume-title":"LNCS 641","author":"L. Hendren","year":"1992","unstructured":"L. Hendren, G.R. Gao, E.R. Altman, and C. Mukerji, \u201cA Register Allocation Framework based upon Hierarchical Cyclic Interval Graphs,\u201d Intnl. Workshop on Compiler Construction, LNCS 641 Springer Verlag, pages 176\u2013191, Germany, 1992."},{"key":"1_CR14","unstructured":"V. Kathail, M. Schlansker, and B. Rau, HPL PlayDoh Architecture Specification: Version 1.0, HPL-93-80, February, 1994."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. Ruthing, and B. Steffen, \u201cOptimal Code Motion: Theory and Practice,\u201d ACM TOPLAS, vol. 16, num. 4, 1117\u20131155.","DOI":"10.1145\/183432.183443"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"P. Kolte and M.J. Harrold, \u201cLoad\/Store Range Analysis for Global Register Allocation,\u201d Proc. of the SIGPLAN Conference on Programming Language Design and Implementation, Albuquerque, New Mexico, pages 268\u2013277, June 1994.","DOI":"10.1145\/173262.155116"},{"issue":"No.2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/359060.359069","volume":"22","author":"E. Morel","year":"1979","unstructured":"E. Morel and C. Renvoise, \u201cGlobal Optimization by Suppression of Partial Redundancies,\u201d Communications of the ACM, Volume 22, No. 2, pages 96\u2013103, 1979.","journal-title":"Communications of the ACM"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"M. Wolfe and U. Banerjee, \u201cData Dependence and Its Application to Parallel Processing,\u201d Intl. Journal of Parallel Programming, Vol. 16, No. 2, April 1987.","DOI":"10.1007\/BF01379099"}],"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\/BFb0014188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:39:22Z","timestamp":1586565562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607656","9783540494461"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0014188","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0014187","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}