{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:53:57Z","timestamp":1742399637613},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540409274"},{"type":"electronic","value":"9783540409281"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11860990_22","type":"book-chapter","created":{"date-parts":[[2006,9,16]],"date-time":"2006-09-16T03:05:22Z","timestamp":1158375922000},"page":"362-376","source":"Crossref","is-referenced-by-count":8,"title":["Fast Profile-Based Partial Redundancy Elimination"],"prefix":"10.1007","author":[{"given":"R. Nigel","family":"Horspool","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Scholz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A. Aho","year":"1986","unstructured":"Aho, A., Sethi, R., Ullman, J.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)"},{"issue":"6","key":"22_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/363011.363153","volume":"12","author":"M. Breuer","year":"1969","unstructured":"Breuer, M.: Generation of optimal code for expressions via factorization. CACM\u00a012(6), 333\u2013340 (1969)","journal-title":"CACM"},{"key":"22_CR3","unstructured":"Cai, Q., Xue, J.: Optimal and efficient speculation-based partial redundancy elimination. In: CGO 2003: Proceedings of the ACM\/IEEE 2003 Symposium on Code Generation and Optimization, pp. 91\u2013104 (2003)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Cocke, J.: Global common subexpression elimination. In: Proceedings of a symposium on compiler optimization, pp. 20\u201324 (1970)","DOI":"10.1145\/800028.808480"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/103135.214520","volume":"13","author":"D. Dhamdhere","year":"1991","unstructured":"Dhamdhere, D.: Practical adaptation of the global optimization algorithm of Morel and Renvoise. ACM Transactions on Programming Languages and Systems\u00a013(2), 291\u2013294 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Horspool, R., Ho, H.: Partial redundancy elimination driven by a cost-benefit analysis. In: Proceedings of the 8th Israeli Conference on Computer Systems and Software Engineering, pp. 111\u2013118 (1997)","DOI":"10.1109\/ICCSSE.1997.599882"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00290339","volume":"7","author":"J.B. Kam","year":"1977","unstructured":"Kam, J.B., Ullman, J.D.: Monotone data flow analysis frameworks. Acta Informatica\u00a07, 309\u2013317 (1977)","journal-title":"Acta Informatica"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Knoop, J., Ruthing, 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 (1992)","DOI":"10.1145\/143095.143136"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1145\/183432.183443","volume":"16","author":"J. Knoop","year":"1994","unstructured":"Knoop, J., Ruthing, O., Steffen, B.: Optimal code motion: theory and practice. ACM Transactions on Programming Languages and Systems\u00a016(4), 1117\u20131155 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"22_CR10","doi-asserted-by":"crossref","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. CACM\u00a022(2), 96\u2013103 (1979)","journal-title":"CACM"},{"key":"22_CR11","first-page":"160","volume-title":"Program Flow Analysis: Theory and Applications","author":"E. Morel","year":"1981","unstructured":"Morel, E., Renvoise, C.: Interprocedural elimination of partial redundancies. In: Muchnik, S., Jones, N. (eds.) Program Flow Analysis: Theory and Applications, pp. 160\u2013188. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"22_CR12","volume-title":"Advanced Compiler Design and Implementation","author":"S. Muchnik","year":"1997","unstructured":"Muchnik, S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Scholz, B., Horspool, N., Knoop, J.: Optimizing for space and time usage with speculative partial redundancy elimination. In: LCTES 2004: Proceedings of ACM SIGPLAN\/SIGBED 2004 Conference on Languages, Compilers, and Tools for Embedded Systems, pp. 221\u2013230 (2004)","DOI":"10.1145\/997163.997195"},{"key":"22_CR14","unstructured":"Standard\u00a0Performance\u00a0Evaluation\u00a0Corporation. Cpu2000 (2006), \n                  \n                    http:\/\/www.spec.org"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"SE-3","author":"H. Stone","year":"1977","unstructured":"Stone, H.: Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering\u00a0SE-3(1), 85\u201393 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"6","key":"22_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/606666.606675","volume":"34","author":"M. Wolfe","year":"1999","unstructured":"Wolfe, M.: Partial redundancy elimination is not bidirectional. SIGPLAN Notices\u00a034(6), 43\u201346 (1999)","journal-title":"SIGPLAN Notices"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Xue, J., Cai, Q.: A lifetime optimal algorithm for speculative pre. ACM Transactions on Architecture and Code Generation (to appear, 2006)","DOI":"10.1145\/1138035.1138036"}],"container-title":["Lecture Notes in Computer Science","Modular Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11860990_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:20:18Z","timestamp":1619508018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11860990_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540409274","9783540409281"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11860990_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}