{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T12:59:02Z","timestamp":1790859542604,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642119699","type":"print"},{"value":"9783642119705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11970-5_12","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T19:23:33Z","timestamp":1267989813000},"page":"205-223","source":"Crossref","is-referenced-by-count":7,"title":["Preference-Guided Register Assignment"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Braun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Mallon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Hack","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"45","volume":"6","author":"G.J. Chaitin","year":"1981","unstructured":"Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via graph coloring. Journal of Computer Languages\u00a06, 45\u201357 (1981)","journal-title":"Journal of Computer Languages"},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1109\/TCAD.2006.870409","volume":"25","author":"P. Brisk","year":"2006","unstructured":"Brisk, P., Dabiri, F., Jafari, R., Sarrafzadeh, M.: Optimal Register Sharing for High-Level Synthesis of SSA Form Programs. IEEE Trans. on CAD of Integrated Circuits and Systems\u00a025(5), 772\u2013779 (2006)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"key":"12_CR3","volume-title":"CGO","author":"F. Bouchez","year":"2007","unstructured":"Bouchez, F., Darte, A., Rastello, F.: On the Complexity of Register Coalescing. In: CGO, San Jose, USA. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11688839_20","volume-title":"Compiler Construction","author":"S. Hack","year":"2006","unstructured":"Hack, S., Grund, D., Goos, G.: Register Allocation for Programs in SSA Form. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 247\u2013262. Springer, Heidelberg (2006)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/1375581.1375610","volume-title":"PLDI","author":"S. Hack","year":"2008","unstructured":"Hack, S., Goos, G.: Copy Coalescing by Graph Recoloring. In: PLDI, pp. 227\u2013237. ACM Press, New York (2008)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-00722-4_13","volume-title":"Compiler Construction","author":"M. Braun","year":"2009","unstructured":"Braun, M., Hack, S.: Register Spilling and Live-Range Splitting for SSA-Form Programs. In: de Moor, O., Schwartzbach, M.I. (eds.) CC 2009. LNCS, vol.\u00a05501, pp. 174\u2013189. Springer, Heidelberg (2009)"},{"key":"12_CR7","volume-title":"Building an Optimizing Compiler","author":"R. Morgan","year":"1998","unstructured":"Morgan, R.: Building an Optimizing Compiler. Digital Press, Newton (1998)"},{"key":"12_CR8","unstructured":"Paleczny, M., Vick, C., Click, C.: The Java HotSpotTMServer Compiler. In: Proceedings of the JavaTM Virtual Machine Research and Technology Symposium (JVM 2001) (April 2001)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Hack, S.: Register Allocation for Programs in SSA Form. PhD thesis, Universit\u00e4t Karlsruhe (October 2007)","DOI":"10.1007\/11688839_20"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/178243.178251","volume-title":"PLDI","author":"T.A. Wagner","year":"1994","unstructured":"Wagner, T.A., Maverick, V., Graham, S.L., Harrison, M.A.: Accurate Static Estimators for Program Optimization. In: PLDI, pp. 85\u201396. ACM, New York (1994)"},{"key":"12_CR11","first-page":"114","volume-title":"CGO","author":"B. Boissinot","year":"2009","unstructured":"Boissinot, B., Darte, A., Dupont de Dinechin, B., Guillon, C., Rastello, F.: Revisiting out-of-SSA translation for correctness, code quality, and efficiency. In: CGO, pp. 114\u2013125. IEEE Computer Society Press, Los Alamitos (2009); Best paper award"},{"key":"12_CR12","unstructured":"The\u00a0libFirm Compiler, http:\/\/www.libfirm.org"},{"key":"12_CR13","unstructured":"Standard Performance Evaluation Corporation: SPEC CPU2000 V1.3"},{"key":"12_CR14","unstructured":"Valgrind Instrumentation Framework for Building Dynamic Analysis Tools, http:\/\/www.valgrind.org"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P. Briggs","year":"1994","unstructured":"Briggs, P., Cooper, K.D., Torczon, L.: Improvements to Graph Coloring Register Allocation. TOPLAS\u00a016(3), 428\u2013455 (1994)","journal-title":"TOPLAS"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/229542.229546","volume":"18","author":"L. George","year":"1996","unstructured":"George, L., Appel, A.W.: Iterated Register Coalescing. TOPLAS\u00a018(3), 300\u2013324 (1996)","journal-title":"TOPLAS"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1145\/1011508.1011512","volume":"26","author":"J. Park","year":"2004","unstructured":"Park, J., Moon, S.M.: Optimistic Register Coalescing. ACM Transactions on Programming Languages and Systems\u00a026(4), 735\u2013765 (2004)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/800229.806957","volume-title":"SIGPLAN 1979: Proceedings of the 1979 SIGPLAN Symposium on Compiler Construction","author":"J. Fabri","year":"1979","unstructured":"Fabri, J.: Automatic Storage Optimization. In: SIGPLAN 1979: Proceedings of the 1979 SIGPLAN Symposium on Compiler Construction, pp. 83\u201391. ACM Press, New York (1979)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Appel, A.W., George, L.: Optimal Spilling for CISC Machines with Few Registers. In: ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, June 2001, pp. 243\u2013253 (2001)","DOI":"10.1145\/378795.378854"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/353926.353929","volume":"22","author":"G.Y. Lueh","year":"2000","unstructured":"Lueh, G.Y., Gross, T., Adl-Tabatabai, A.R.: Fusion-based Register Allocation. ACM Transactions on Programming Languages and Systems\u00a022(3), 431\u2013470 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/1133981.1134007","volume-title":"PLDI 2006: Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"T. Nakaike","year":"2006","unstructured":"Nakaike, T., Inagaki, T., Komatsu, H., Nakatani, T.: Profile-based Global Live-Range Splitting. In: PLDI 2006: Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 216\u2013227. ACM Press, New York (2006)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/1064979.1064998","volume-title":"VEE 2005: Proceedings of the 1st ACM\/USENIX international Conference on Virtual Execution Environments","author":"C. Wimmer","year":"2005","unstructured":"Wimmer, C., M\u00f6ssenb\u00f6ck, H.: Optimized interval splitting in a linear scan register allocator. In: VEE 2005: Proceedings of the 1st ACM\/USENIX international Conference on Virtual Execution Environments, pp. 132\u2013141. ACM Press, New York (2005)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/277650.277714","volume-title":"PLDI 1988: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation","author":"O. Traub","year":"1998","unstructured":"Traub, O., Holloway, G., Smith, M.D.: Quality and speed in linear-scan register allocation. In: PLDI 1988: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, pp. 142\u2013151. ACM Press, New York (1998)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-71229-9_10","volume-title":"Compiler Construction","author":"V. Sarkar","year":"2007","unstructured":"Sarkar, V., Barik, R.: Extended linear scan: An alternate foundation for global register allocation. In: Krishnamurthi, S., Odersky, M. (eds.) CC 2007. LNCS, vol.\u00a04420, pp. 141\u2013155. Springer, Heidelberg (2007)"},{"key":"12_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/512529.512534","volume-title":"PLDI","author":"Z. Budimli\u0107","year":"2002","unstructured":"Budimli\u0107, Z., Cooper, K.D., Harvey, T.J., Kennedy, K., Oberg, T.S., Reeves, S.W.: Fast copy coalescing and live-range identification. In: PLDI, pp. 25\u201332. ACM Press, New York (2002)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-72521-3_21","volume-title":"Languages and Compilers for Parallel Computing","author":"F. Bouchez","year":"2007","unstructured":"Bouchez, F., Darte, A., Guillon, C., Rastello, F.: Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How? In: Alm\u00e1si, G.S., Ca\u015fcaval, C., Wu, P. (eds.) KSEM 2006. LNCS, vol.\u00a04382, pp. 283\u2013298. Springer, Heidelberg (2007)"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., Rastello, F.: Advanced Conservative and Optimistic Register Coalescing. In: CASES, pp. 147\u2013156 (2008)","DOI":"10.1145\/1450095.1450119"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Brisk, P., Verma, A.K., Ienne, P.: An Optimistic and Conservative Register Assignment Heuristic for Chordal Graphs. In: CASES, pp. 209\u2013217 (2007)","DOI":"10.1145\/1289881.1289919"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/1375581.1375609","volume-title":"PLDI","author":"F. Pereira","year":"2008","unstructured":"Pereira, F., Palsberg, J.: Register Allocation by Puzzle Solving. In: PLDI, pp. 216\u2013226. ACM, New York (2008)"}],"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_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T15:56:25Z","timestamp":1685462185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11970-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119699","9783642119705"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11970-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}