{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:11:52Z","timestamp":1725549112886},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119699"},{"type":"electronic","value":"9783642119705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11970-5_3","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T00:23:33Z","timestamp":1268007813000},"page":"26-45","source":"Crossref","is-referenced-by-count":2,"title":["Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values"],"prefix":"10.1007","author":[{"given":"Shuhan","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soner","family":"\u00d6nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"Compilers: principles, techniques, and tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc., Boston (1986)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/567067.567085","volume-title":"POPL 1983: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages","author":"J.R. Allen","year":"1983","unstructured":"Allen, J.R., Kennedy, K., Porterfield, C., Warren, J.: Conversion of control dependence to data dependence. In: POPL 1983: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 177\u2013189. ACM, New York (1983)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1145\/765568.765573","volume":"50","author":"G. Bilardi","year":"2003","unstructured":"Bilardi, G., Pingali, K.: Algorithms for computing the static single assignment form. J. ACM\u00a050(3), 375\u2013425 (2003)","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/277650.277653","volume-title":"PLDI 1998: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation","author":"R. Bod\u00edk","year":"1998","unstructured":"Bod\u00edk, R., Gupta, R., Soffa, M.L.: Complete removal of redundant expressions. In: PLDI 1998: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, pp. 1\u201314. ACM, New York (1998)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/258915.258940","volume-title":"PLDI 1997: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation","author":"F. Chow","year":"1997","unstructured":"Chow, F., Chan, S., Kennedy, R., Liu, S.M., Lo, R., Tu, P.: A new algorithm for partial redundancy elimination based on ssa form. In: PLDI 1997: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, pp. 273\u2013286. ACM, New York (1997)"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/223428.207154","volume":"30","author":"C. Click","year":"1995","unstructured":"Click, C.: Global code motion\/global value numbering. SIGPLAN Not.\u00a030(6), 246\u2013257 (1995)","journal-title":"SIGPLAN Not."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst.\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst.\u00a09(3), 319\u2013349 (1987)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/143095.143136","volume-title":"PLDI 1992: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation","author":"J. Knoop","year":"1992","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Lazy code motion. In: PLDI 1992: Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, pp. 224\u2013234. ACM, New York (1992)"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1145\/183432.183443","volume":"16","author":"J. Knoop","year":"1994","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Optimal code motion: theory and practice. ACM Trans. Program. Lang. Syst.\u00a016(4), 1117\u20131155 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/MICRO.1992.696999","volume-title":"MICRO 25: Proceedings of the 25th annual international symposium on Microarchitecture","author":"S.A. Mahlke","year":"1992","unstructured":"Mahlke, S.A., Lin, D.C., Chen, W.Y., Hank, R.E., Bringmann, R.A.: Effective compiler support for predicated execution using the hyperblock. In: MICRO 25: Proceedings of the 25th annual international symposium on Microarchitecture, pp. 45\u201354. IEEE Computer Society Press, Los Alamitos (1992)"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/359060.359069","volume":"22","author":"E. Morel","year":"1979","unstructured":"Morel, E., Renvoise, C.: Global optimization by suppression of partial redundancies. Commun. ACM\u00a022(2), 96\u2013103 (1979)","journal-title":"Commun. ACM"},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/93548.93578","volume":"25","author":"K.J. Ottenstein","year":"1990","unstructured":"Ottenstein, K.J., Ballance, R.A., MacCabe, A.B.: The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages. SIGPLAN Not.\u00a025(6), 257\u2013271 (1990)","journal-title":"SIGPLAN Not."},{"doi-asserted-by":"crossref","unstructured":"Pingali, K., Beck, M., Johnson, R.C., Moudgill, M., Stodghill, P.: Dependence flow graphs: An algebraic approach to program dependencies. Tech. rep., Cornell University, Ithaca, NY, USA (1990)","key":"3_CR14","DOI":"10.1145\/99583.99595"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/1356058.1356066","volume-title":"CGO 2008: Proceedings of the sixth annual IEEE\/ACM international symposium on Code generation and optimization","author":"A. Thakur","year":"2008","unstructured":"Thakur, A., Govindarajan, R.: Comprehensive path-sensitive data-flow analysis. In: CGO 2008: Proceedings of the sixth annual IEEE\/ACM international symposium on Code generation and optimization, pp. 55\u201363. ACM, New York (2008)"},{"issue":"15","key":"3_CR16","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/spe.618","volume":"34","author":"T. VanDrunen","year":"2004","unstructured":"VanDrunen, T., Hosking, A.L.: Anticipation-based partial redundancy elimination for static single assignment form. Softw. Pract. Exper.\u00a034(15), 1413\u20131439 (2004)","journal-title":"Softw. Pract. Exper."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/155090.155118","volume-title":"PLDI 1993: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation","author":"N.J. Warter","year":"1993","unstructured":"Warter, N.J., Mahlke, S.A., Hwu, W.M.W., Rau, B.R.: Reverse if-conversion. In: PLDI 1993: Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, pp. 290\u2013299. ACM, New York (1993)"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M.N. Wegman","year":"1991","unstructured":"Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. ACM Trans. Program. Lang. Syst.\u00a013(2), 181\u2013210 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11970-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:45:59Z","timestamp":1606185959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11970-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119699","9783642119705"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11970-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}