{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T12:59:27Z","timestamp":1790859567178,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"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_10","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T00:23:33Z","timestamp":1268007813000},"page":"165-184","source":"Crossref","is-referenced-by-count":5,"title":["Punctual Coalescing"],"prefix":"10.1007","author":[{"given":"Fernando Magno Quint\u00e3o","family":"Pereira","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"7","key":"10_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1273444.1254781","volume":"42","author":"M. Ahn","year":"2007","unstructured":"Ahn, M., Lee, J., Paek, Y.: Optimistic coalescing for heterogeneous register architectures. SIGPLAN Notices\u00a042(7), 93\u2013102 (2007)","journal-title":"SIGPLAN Notices"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/378795.378854","volume-title":"PLDI","author":"A.W. Appel","year":"2001","unstructured":"Appel, A.W., George, L.: Optimal spilling for CISC machines with few registers. In: PLDI, pp. 243\u2013253. ACM, New York (2001)"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/155090.155119","volume-title":"PLDI","author":"T. Ball","year":"1993","unstructured":"Ball, T., Larus, J.R.: Branch prediction for free. In: PLDI, pp. 300\u2013313. ACM, New York (1993)"},{"issue":"1-3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M. Bir\u00f3","year":"1992","unstructured":"Bir\u00f3, M., Hujter, M., Tuza, Z.: Precoloring extension. I. interval graphs. Discrete Mathematics\u00a0100(1-3), 267\u2013279 (1992)","journal-title":"Discrete Mathematics"},{"key":"10_CR5","unstructured":"Bouchez, F.: Allocation de registres et vidage en m\u00e9moire. Master\u2019s thesis, ENS Lyon (October 2005)"},{"key":"10_CR6","unstructured":"Bouchez, F.: A Study of Spilling and Coalescing in Register Allocation as Two Separate Phases. PhD thesis, ENS Lyon (2008)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1450095.1450119","volume-title":"CASES","author":"F. Bouchez","year":"2008","unstructured":"Bouchez, F., Darte, A., Rastello, F.: Advanced conservative and optimistic register coalescing. In: CASES, pp. 147\u2013156. ACM, New York (2008)"},{"key":"10_CR8","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)"},{"issue":"3","key":"10_CR9","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":"5","key":"10_CR10","first-page":"772","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. TCAD\u00a025(5), 772\u2013779 (2006)","journal-title":"TCAD"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. In: Symposium on Compiler Construction, vol.\u00a017(6), pp. 98\u2013105 (1982)","DOI":"10.1145\/800230.806984"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","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 coloring. Computer Languages\u00a06, 47\u201357 (1981)","journal-title":"Computer Languages"},{"issue":"4","key":"10_CR13","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., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. TOPLAS\u00a013(4), 451\u2013490 (1991)","journal-title":"TOPLAS"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/1542476.1542528","volume-title":"PLDI","author":"A. Gal","year":"2009","unstructured":"Gal, A., Eich, B., Shaver, M., Anderson, D., Kaplan, B., Hoare, G., Mandelin, D., Zbarsky, B., Orendorff, J., Ruderman, J., Smith, E., Reitmair, R., Haghighat, M.R., Bebenita, M., Change, M., Franz, M.: Trace-based just-in-time type specialization for dynamic languages. In: PLDI, pp. 465\u2013478. ACM, New York (2009)"},{"issue":"3","key":"10_CR15","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. Transactions on Programming Languages and Systems (TOPLAS)\u00a018(3), 300\u2013324 (1996)","journal-title":"Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-71229-9_8","volume-title":"Compiler Construction","author":"D. Grund","year":"2007","unstructured":"Grund, D., Hack, S.: A fast cutting-plane algorithm for optimal coalescing. In: Krishnamurthi, S., Odersky, M. (eds.) CC 2007. LNCS, vol.\u00a04420, pp. 111\u2013125. Springer, Heidelberg (2007)"},{"key":"10_CR17","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, New York (2008)"},{"key":"10_CR18","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":"10_CR19","first-page":"297","volume-title":"MICRO","author":"T. Kong","year":"1998","unstructured":"Kong, T., Wilken, K.D.: Precise register allocation for irregular architectures. In: MICRO, pp. 297\u2013307. IEEE, Los Alamitos (1998)"},{"key":"10_CR20","first-page":"75","volume-title":"CGO","author":"C. Lattner","year":"2004","unstructured":"Lattner, C., Adve, V.S.: LLVM: A compilation framework for lifelong program analysis & transformation. In: CGO, pp. 75\u201388. IEEE, Los Alamitos (2004)"},{"issue":"1-3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.tcs.2008.05.025","volume":"407","author":"J.K. Lee","year":"2008","unstructured":"Lee, J.K., Palsberg, J., Pereira, F.M.Q.: Aliased register allocation. Theoretical Computer Science\u00a0407(1-3), 258\u2013273 (2008)","journal-title":"Theoretical Computer Science"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-74061-2_10","volume-title":"Static Analysis","author":"V.K. Nandivada","year":"2007","unstructured":"Nandivada, V.K., Pereira, F., Palsberg, J.: A framework for end-to-end verification and evaluation of register allocators. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 153\u2013169. Springer, Heidelberg (2007)"},{"key":"10_CR23","unstructured":"Park, J., Moon, S.-M.: Optimistic register coalescing. In: IEEE PACT, pp. 196\u2013204 (1998)"},{"key":"10_CR24","unstructured":"Pereira, F.M.Q.: Register Allocation by Puzzle Solving. PhD thesis, University of California, Los Angeles (2008)"},{"key":"10_CR25","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":"10_CR26","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/1375581.1375609","volume-title":"PLDI","author":"F.M.Q. Pereira","year":"2008","unstructured":"Pereira, F.M.Q., Palsberg, J.: Register allocation by puzzle solving. In: PLDI, pp. 216\u2013226. ACM, New York (2008)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-00722-4_12","volume-title":"Compiler Construction","author":"F.M.Q. Pereira","year":"2009","unstructured":"Pereira, F.M.Q., Palsberg, J.: SSA elimination after register allocation. In: de Moor, O., Schwartzbach, M.I. (eds.) CC 2009. LNCS, vol.\u00a05501, pp. 158\u2013173. Springer, Heidelberg (2009)"},{"key":"10_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: Twelf - a meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"issue":"5","key":"10_CR29","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1145\/330249.330250","volume":"21","author":"M. Poletto","year":"1999","unstructured":"Poletto, M., Sarkar, V.: Linear scan register allocation. TOPLAS\u00a021(5), 895\u2013913 (1999)","journal-title":"TOPLAS"},{"key":"10_CR30","unstructured":"Rastello, F., de Ferri\u00e9re, F., Guillon, C.: Optimizing translation out of SSA using renaming constraints. Technical Report 03-35, \u00c9cole Normale Sup\u00e9rieure de Lyon (2003)"},{"key":"10_CR31","first-page":"141","volume-title":"LCTES\/CC","author":"V. Sarkar","year":"2007","unstructured":"Sarkar, V., Barik, R.: Extended linear scan: an alternate foundation for global register allocation. In: LCTES\/CC, pp. 141\u2013155. ACM, New York (2007)"},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/513829.513854","volume-title":"LCTES\/SCOPES","author":"B. Scholz","year":"2002","unstructured":"Scholz, B., Eckstein, E.: Register allocation for irregular architectures. In: LCTES\/SCOPES, pp. 139\u2013148. ACM, New York (2002)"},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/996841.996875","volume-title":"PLDI","author":"M.D. Smith","year":"2004","unstructured":"Smith, M.D., Ramsey, N., Holloway, G.: A generalized algorithm for graph-coloring register allocation. In: PLDI, pp. 277\u2013288. ACM, New York (2004)"},{"key":"10_CR34","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/277650.277714","volume-title":"PLDI","author":"O. Traub","year":"1998","unstructured":"Traub, O., Holloway, G.H., Smith, M.D.: Quality and speed in linear-scan register allocation. In: PLDI, pp. 142\u2013151. ACM, New York (1998)"}],"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_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T19:56:23Z","timestamp":1685476583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11970-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119699","9783642119705"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11970-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}