{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:44Z","timestamp":1763467724493},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330509"},{"type":"electronic","value":"9783540330516"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11688839_20","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T07:41:48Z","timestamp":1143531708000},"page":"247-262","source":"Crossref","is-referenced-by-count":72,"title":["Register Allocation for Programs in SSA-Form"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Hack","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Grund","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Goos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_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"},{"key":"20_CR2","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. ACM Trans. Program. Lang. Syst.\u00a016, 428\u2013455 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_CR3","volume-title":"Algorithmic Graph Theory And Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory And Perfect Graphs. Academic Press, London (1980)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/512529.512534","volume-title":"Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation","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: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp. 25\u201332. ACM Press, New York (2002)"},{"key":"20_CR5","unstructured":"Bouchez, F.: Allocation de registres et vidage en m\u00e9moire. Master\u2019s thesis, \u00c9NS Lyon (2005)"},{"key":"20_CR6","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, 3rd edn., vol.\u00a0173. Springer, Heidelberg (2005)","edition":"3"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/258915.258941","volume-title":"PLDI 1997: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation","author":"P. Bergner","year":"1997","unstructured":"Bergner, P., Dahl, P., Engebretsen, D., O\u2019Keefe, M.: Spill code minimization via interference region spilling. In: PLDI 1997: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, pp. 287\u2013295. ACM Press, New York (1997)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/88616.88621","volume":"12","author":"F.C. Chow","year":"1990","unstructured":"Chow, F.C., Hennessy, J.L.: The priority-based coloring approach to register allocation. ACM Trans. Program. Lang. Syst.\u00a012, 501\u2013536 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1109\/TSE.1989.559775","volume":"15","author":"W.C. Hsu","year":"1989","unstructured":"Hsu, W.C., Fisher, C.N., Goodman, J.R.: On the Minimization of Loads\/Stores in Local Register Allocation. IEEE Trans. Softw. Eng.\u00a015, 1252\u20131260 (1989)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24644-2_24","volume-title":"Languages and Compilers for Parallel Computing","author":"J. Guo","year":"2004","unstructured":"Guo, J., Garzaran, M.J., Padua, D.: The Power of Belady\u2019s Algorithm in Register Allocation for Long Basic Blocks. In: Rauchwerger, L. (ed.) LCPC 2003. LNCS, vol.\u00a02958. Springer, Heidelberg (2004)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. Belady","year":"1966","unstructured":"Belady, L.: A Study of Replacement of Algorithms for a Virtual Storage Computer. IBM Systems Journal\u00a05, 78\u2013101 (1966)","journal-title":"IBM Systems Journal"},{"key":"20_CR12","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., Zadek, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems\u00a013, 451\u2013490 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"20_CR13","first-page":"859","volume":"28","author":"P. Briggs","year":"1998","unstructured":"Briggs, P., Cooper, K.D., Harvey, T.J., Simpson, L.T.: Practical Improvements to the Construction and Destruction of Static Single Assignment Form. Software: Practice and Experience\u00a028, 859\u2013881 (1998)","journal-title":"Software: Practice and Experience"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Hack, S., Grund, D., Goos, G.: Towards Register Allocation for Programs in SSA-form. Technical Report 2005-27, Universit\u00e4t Karlsruhe (2005)","DOI":"10.1007\/11688839_20"},{"key":"20_CR15","unstructured":"Lindenmaier, G., Beck, M., Boesler, B., Gei\u00df, R.: Firm, an intermediate language for compiler research. Technical Report 2005-8, University of Karlsruhe (2005)"},{"key":"20_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. ACM Trans. Program. Lang. Syst.\u00a018, 300\u2013324 (1996)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_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 Trans. Program. Lang. Syst.\u00a026, 735\u2013765 (2004)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-36579-6_3","volume-title":"Compiler Construction","author":"C. Andersson","year":"2003","unstructured":"Andersson, C.: Register Allocation by Optimal Graph Coloring. In: Hedin, G. (ed.) CC 2003. LNCS, vol.\u00a02622, pp. 33\u201345. Springer, Heidelberg (2003)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/11575467_21","volume-title":"Programming Languages and Systems","author":"F.M.Q. Pereira","year":"2005","unstructured":"Pereira, F.M.Q., Palsberg, J.: Register allocation via coloring of chordal graphs. In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 315\u2013329. Springer, Heidelberg (2005)"},{"key":"20_CR20","unstructured":"Hack, S.: Interference Graphs of Programs in SSA-form. Technical Report 2005-15, Universit\u00e4t Karlsruhe (2005)"},{"key":"20_CR21","volume-title":"14th International Workshop on Logic and Synthesis","author":"P. Brisk","year":"2005","unstructured":"Brisk, P., Dabiri, F., Macbeth, J., Sarrafzadeh, M.: Polynomial time graph coloring register allocation. In: 14th International Workshop on Logic and Synthesis. ACM Press, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11688839_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T17:46:44Z","timestamp":1683395204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11688839_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330509","9783540330516"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11688839_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}