{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:23Z","timestamp":1725485603522},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650140"},{"type":"electronic","value":"9783540497271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49727-7_1","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T23:02:49Z","timestamp":1181170969000},"page":"1-16","source":"Crossref","is-referenced-by-count":1,"title":["Bidirectional Data Flow Analysis in Code Motion: Myth and Reality"],"prefix":"10.1007","author":[{"given":"Oliver","family":"R\u00fcthing","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"issue":"10","key":"1_CR1","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/51607.51621","volume":"23","author":"D. M. Dhamdhere","year":"1988","unstructured":"D. M. Dhamdhere. A fast algorithm for code movement optimization. ACM SIGPLAN Notices, 23(10):172\u2013180, 1988.","journal-title":"ACM SIGPLAN Notices"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207168808803702","volume":"27","author":"D. M. Dhamdhere","year":"1989","unstructured":"D. M. Dhamdhere. A new algorithm for composite hoisting and strength reduction optimisation (+ Corrigendum). International Journal of Computer Mathematics, 27:1\u201314 (+ 31\u201332), 1989.","journal-title":"International Journal of Computer Mathematics"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0096-0551(90)90012-E","volume":"15","author":"D. M. Dhamdhere","year":"1990","unstructured":"D. M. Dhamdhere. A usually linear algorithm for register assignment using edge placement of load and store instructions. Journal of Computer Languages, 15(2):83\u201394, 1990.","journal-title":"Journal of Computer Languages"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/103135.214520","volume":"13","author":"D. M. Dhamdhere","year":"1991","unstructured":"D. M. Dhamdhere. Practical adaptation of the global optimization algorithm of Morel and Renvoise. ACM Transactions on Programming Languages and Systems, 13(2):291\u2013294, 1991. Technical Correspondence.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"D. M. Dhamdhere and U. P. Khedker. Complexity of bidirectional data flow analysis. In Conf. Record of the 20 th ACM Symposium on the Principles of Programming Languages, pages 397\u2013409, Charleston, SC, January 1993.","DOI":"10.1145\/158511.158696"},{"issue":"2","key":"1_CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/169701.169684","volume":"15","author":"D. M. Dhamdhere","year":"1993","unstructured":"D. M. Dhamdhere and H. Patil. An elimination algorithm for bidirectional data flow problems using edge placement. ACM Transactions on Programming Languages and Systems, 15(2):312\u2013336, April 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"D. M. Dhamdhere, B. K. Rosen, and F. K. Zadeck. How to analyze large programs efficiently and informatively. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation\u201992, volume 27,7 of ACM SIGPLAN Notices, pages 212\u2013223, San Francisco, CA, June 1992.","DOI":"10.1145\/143095.143135"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/48022.214509","volume":"10","author":"K.-H. Drechsler","year":"1988","unstructured":"K.-H. Drechsler and M. P. Stadel. A solution to a problem with Morel and Renvoise\u2019s \u201cGlobal optimization by suppression of partial redundancies\u201d. ACM Transactions on Programming Languages and Systems, 10(4):635\u2013640, 1988. Technical Correspondence.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"5","key":"1_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/152819.152823","volume":"28","author":"K.-H. Drechsler","year":"1993","unstructured":"K.-H. Drechsler and M. P. Stadel. A variation of Knoop, R\u00fcthing and Steffen\u2019s lazy code motion. ACM SIGPLAN Notices, 28(5):29\u201338, 1993.","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/0204044","volume":"4","author":"M. S. Hecht","year":"1977","unstructured":"M. S. Hecht and J. D. Ullman. A simple algorithm for global data flow analysis problems. SIAM Journal on Computing, 4(4):519\u2013532, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00282621","volume":"24","author":"S. Horwitz","year":"1987","unstructured":"S. Horwitz, A. Demers, and T. Teitelbaum. An efficient general iterative algorithm for data flow analysis. Acta Informatica, 24:679\u2013694, 1987.","journal-title":"Acta Informatica"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1080\/00207168208803296","volume":"11","author":"S. M. Joshi","year":"1982","unstructured":"S. M. Joshi and D. M. Dhamdhere. A composite hoisting-strength reduction transformation for global program optimization-part I. International Journal of Computer Mathematics, 11:21\u201341, 1982.","journal-title":"International Journal of Computer Mathematics"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1080\/00207168208803303","volume":"11","author":"S. M. Joshi","year":"1982","unstructured":"S. M. Joshi and D. M. Dhamdhere. A composite hoisting-strength reduction transformation for global program optimization-part II. International Journal of Computer Mathematics, 11:111\u2013126, 1982.","journal-title":"International Journal of Computer Mathematics"},{"issue":"5","key":"1_CR14","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1145\/186025.186043","volume":"16","author":"U. P. Khedker","year":"1994","unstructured":"U. P. Khedker and D. M. Dhamdhere. A generalized theory of bit vector data flow analysis. ACM Transactions on Programming Languages and Systems, 16(5):1472\u20131511, September 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. Lazy code motion. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation\u201992, volume 27,7 of ACM SIGPLAN Notices, pages 224\u2013234, San Francisco, CA, June 1992.","DOI":"10.1145\/143103.143136"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1145\/183432.183443","volume":"16","author":"J. Knoop","year":"1994","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, 16(4):1117\u20131155, 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"5","key":"1_CR17","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/213978.213989","volume":"17","author":"P. M. Masticola","year":"1995","unstructured":"P. M. Masticola, T. J. Marlowe, and B. G. Ryder. Lattice frameworks for multisource and bidirectional data flow problems. ACM Transactions on Programming Languages and Systems, 17(5):777\u2013802, 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"1_CR18","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. Global optimization by suppression of partial redundancies. Communications of the ACM, 22(2):96\u2013103, 1979.","journal-title":"Communications of the ACM"},{"key":"1_CR19","volume-title":"PhD thesis","author":"O. R\u00fcthing","year":"1997","unstructured":"O. R\u00fcthing. Interacting Code Motion Transformations. Their Impact and their complexity. PhD thesis, Institut f\u00fcr Informatik und Praktische Mathematik, Christian-Albrechts-Universit\u00e4t Kiel, Germany, 1997. Available as http:\/\/sunshine.cs.uni-dortmund.de\/~ruething\/diss.ps.gz ."},{"key":"1_CR20","unstructured":"O. R\u00fcthing. Optimal code motion in the presence of large expressions. In Proc. Internatinal Conference on Computer Languages (ICCL\u201998), Chicago, IL., 1998. IEEE."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49727-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:46:06Z","timestamp":1556466366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49727-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650140","9783540497271"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-49727-7_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}