{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T12:16:18Z","timestamp":1672748178859},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4580,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0167-6423(00)00016-2","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"3-29","source":"Crossref","is-referenced-by-count":2,"title":["Code motion in the presence of critical edges without bidirectional data flow analysis"],"prefix":"10.1016","volume":"39","author":[{"given":"Oliver","family":"R\u00fcthing","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6423(00)00016-2_BIB1","unstructured":"F. Chow, A portable machine independent optimizer \u2013 Design and measurements, Ph.D. thesis, Standford University, Dept. of Electrical Engineering, Stanford, CA, 1983. Published as Tech. Rep. 83\u2013254, Computer Systems Lab., Stanford University."},{"issue":"10","key":"10.1016\/S0167-6423(00)00016-2_BIB2","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/51607.51621","article-title":"A fast algorithm for code movement optimization","volume":"23","author":"Dhamdhere","year":"1988","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207168808803702","article-title":"A new algorithm for composite hoisting and strength reduction optimisation (+ Corrigendum)","volume":"27","author":"Dhamdhere","year":"1989","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"10.1016\/S0167-6423(00)00016-2_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0096-0551(90)90012-E","article-title":"A usually linear algorithm for register assignment using edge placement of load and store instructions","volume":"15","author":"Dhamdhere","year":"1990","journal-title":"J. Comput. Languages"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB5","doi-asserted-by":"crossref","unstructured":"D.M. Dhamdhere, Practical adaptation of the global optimization algorithm of Morel and Renvoise, ACM Trans. Programm. Languages Systems 13 (2) (1991) 291\u2013294. Technical Correspondence.","DOI":"10.1145\/103135.214520"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB6","doi-asserted-by":"crossref","unstructured":"D.M. Dhamdhere, U.P. Khedker, Complexity of bidirectional data flow analysis, Conf. Record of the 20th ACM Symp. on the Principles of Programming Languages (POPL), Charleston, SC, January 1993, pp. 397\u2013409.","DOI":"10.1145\/158511.158696"},{"issue":"2","key":"10.1016\/S0167-6423(00)00016-2_BIB7","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/169701.169684","article-title":"An elimination algorithm for bidirectional data flow problems using edge placement","volume":"15","author":"Dhamdhere","year":"1993","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB8","doi-asserted-by":"crossref","unstructured":"D.M. Dhamdhere, B.K. Rosen, F.K. Zadeck, How to analyze large programs efficiently and informatively, Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI)\u201992, ACM SIGPLAN Notices, Vol. 27,7, San Francisco, CA, June 1992, pp. 212\u2013223.","DOI":"10.1145\/143095.143135"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB9","doi-asserted-by":"crossref","unstructured":"K.-H. Drechsler, M.P. Stadel, A solution to a problem with Morel and Renvoise's \u201cGlobal optimization by suppression of partial redundancies\u201d, ACM Trans. Programm. Languages Systems 10 (4) (1988) 635\u2013640. Technical Correspondence.","DOI":"10.1145\/48022.214509"},{"issue":"5","key":"10.1016\/S0167-6423(00)00016-2_BIB10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/152819.152823","article-title":"A variation of Knoop, R\u00fcthing and Steffen's lazy code motion","volume":"28","author":"Drechsler","year":"1993","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"10.1016\/S0167-6423(00)00016-2_BIB11","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/0204044","article-title":"A simple algorithm for global data flow analysis problems","volume":"4","author":"Hecht","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6423(00)00016-2_BIB12","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/BF00282621","article-title":"An efficient general iterative algorithm for data flow analysis","volume":"24","author":"Horwitz","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/S0167-6423(00)00016-2_BIB13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/00207168208803296","article-title":"A composite hoisting-strength reduction transformation for global program optimization \u2013 Part I","volume":"11","author":"Joshi","year":"1982","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0167-6423(00)00016-2_BIB14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1080\/00207168208803303","article-title":"A composite hoisting-strength reduction transformation for global program optimization \u2013 Part II","volume":"11","author":"Joshi","year":"1982","journal-title":"Int. J. Comput. Math."},{"issue":"5","key":"10.1016\/S0167-6423(00)00016-2_BIB15","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1145\/186025.186043","article-title":"A generalized theory of bit vector data flow analysis","volume":"16","author":"Khedker","year":"1994","journal-title":"ACM Trans. Programm. Languges Systems"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB16","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, B. Steffen, Lazy code motion, Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI)\u201992, ACM SIGPLAN Notices, Vol. 27,7, San Francisco, CA, June 1992, pp. 224\u2013234.","DOI":"10.1145\/143095.143136"},{"issue":"1","key":"10.1016\/S0167-6423(00)00016-2_BIB17","first-page":"71","article-title":"Lazy strength reduction","volume":"1","author":"Knoop","year":"1993","journal-title":"J. Programm. Languages"},{"issue":"4","key":"10.1016\/S0167-6423(00)00016-2_BIB18","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1145\/183432.183443","article-title":"Optimal code motion: theory and practice","volume":"16","author":"Knoop","year":"1994","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB19","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, B. Steffen, Partial dead code elimination, Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI)\u201994, ACM SIGPLAN Notices, Vol. 29,6, Orlando, FL, June 1994, pp. 147\u2013158.","DOI":"10.1145\/178243.178256"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB20","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, B. Steffen, The power of assignment motion, Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI)\u201995, ACM SIGPLAN Notices, Vol. 30,6, La Jolla, CA, June 1995, pp. 233\u2013245.","DOI":"10.1145\/207110.207150"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB21","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, B. Steffen, Code motion and code placement: just synonyms? Proc. 6th European Symp. on Programming (ESOP), Lecture Notes in Computer Science, Vol. 1381, Lisbon, Portugal, Springer, Berlin, 1998, pp. 154\u2013196.","DOI":"10.1007\/BFb0053569"},{"issue":"5","key":"10.1016\/S0167-6423(00)00016-2_BIB22","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/213978.213989","article-title":"Lattice frameworks for multisource and bidirectional data flow problems","volume":"17","author":"Masticola","year":"1995","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB23","series-title":"Methods and Tools for Compiler Construction","article-title":"Data flow analysis and global optimization","author":"Morel","year":"1984"},{"issue":"2","key":"10.1016\/S0167-6423(00)00016-2_BIB24","first-page":"96","volume":"22","author":"Morel","year":"1979","journal-title":"Global optimization by suppression of partial redundancies, Comm. ACM"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB25","unstructured":"E. Morel, C. Renvoise, Interprocedural elimination of partial redundancies, in: S.S. Muchnick, N.D. Jones (Eds.), Program Flow Analysis: Theory and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1981, pp. 160\u2013188 (Chapter 6)."},{"key":"10.1016\/S0167-6423(00)00016-2_BIB26","doi-asserted-by":"crossref","unstructured":"O. R\u00fcthing, Interacting code motion transformations: their impact and their complexity, Ph.D. thesis, Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t zu Kiel, Kiel, Germany, 1997. Lecture Notes in Computer Science, Vol. 1539, Springer, Heidelberg, 1998.","DOI":"10.1007\/3-540-49209-7"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB27","unstructured":"O. R\u00fcthing, Bidirectional data flow analysis in code motion: myth and reality, Proc. 5th Int. Static Analysis Symp. (SAS\u201998), Lecture Notes in Computer Science, Vol. 1503, Pisa, Italy, Springer, Berlin, September 1998, pp. 1\u201316."},{"key":"10.1016\/S0167-6423(00)00016-2_BIB28","doi-asserted-by":"crossref","unstructured":"O. R\u00fcthing, Optimal code motion in the presence of large expressions, Proc. IEEE Int. Conf. on Computer Languages, Chicago, Il., May 1998, pp. 216\u2013225.","DOI":"10.1109\/ICCL.1998.674172"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB29","doi-asserted-by":"crossref","unstructured":"O. R\u00fcthing, J. Knoop, B. Steffen, Sparse code motion, Conf. Record of the 27th ACM Symp. on the Principles of Programming Languages (POPL), Boston, MA, January 2000, to appear.","DOI":"10.1145\/325694.325715"},{"key":"10.1016\/S0167-6423(00)00016-2_BIB30","doi-asserted-by":"crossref","unstructured":"A. Sorkin, Some comments on a solution to a problem with Morel and Renvoise's \u201cGlobal optimization by suppression of partial redundancies\u201d, ACM Trans. Programm. Languages Systems 11 (4) (1989) 666\u2013668. Technical Correspondence.","DOI":"10.1145\/69558.214513"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642300000162?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642300000162?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T18:25:08Z","timestamp":1555784708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642300000162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0167642300000162"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(00)00016-2","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}