{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:47Z","timestamp":1772163947272,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T00:00:00Z","timestamp":1212796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,7]]},"DOI":"10.1145\/1375581.1375610","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T10:13:22Z","timestamp":1213092802000},"page":"227-237","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Copy coalescing by graph recoloring"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Hack","sequence":"first","affiliation":[{"name":"ENS Lyon\/Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Gerhard","family":"Goos","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Karlsruhe, Karlsruhe, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378854"},{"key":"e_1_3_2_1_2_1","volume-title":"19th International Workshop on Languages and Compilers for Parallel Computing (LCPC'06)","author":"Bouchez Florent","year":"2006","unstructured":"Florent Bouchez , Alain Darte , Christophe Guillon , and Fabrice Rastello . Register Allocation : What does the NP-Completeness Proof of Chaitin et al. really prove? or revisiting Register Allocation: Why and How? In 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC'06) , New Orleans, USA , Nov 2006 . Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register Allocation: What does the NP-Completeness Proof of Chaitin et al. really prove? or revisiting Register Allocation: Why and How? In 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), New Orleans, USA, Nov 2006."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2007.26"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177575"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(19980710)28:8%3C859::AID-SPE188%3E3.0.CO;2-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.870409"},{"key":"e_1_3_2_1_7_1","first-page":"45","article-title":"Register allocation via graph coloring","volume":"6","author":"Chaitin G. J.","year":"1981","unstructured":"G. J. Chaitin , M. A. Auslander , A. K. Chandra , J. Cocke , M. E. Hopkins , and P. W. Markstein . Register allocation via graph coloring . Journal of Computer Languages , 6 : 45 -- 57 , 1981 . G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins, and P. W. Markstein. Register allocation via graph coloring. Journal of Computer Languages, 6:45--57, 1981.","journal-title":"Journal of Computer Languages"},{"key":"e_1_3_2_1_8_1","volume-title":"Performance Evaluation Corporation. SPEC CPU2000 V1.3. http:\/\/www.spec.org\/cpu2000\/.","author":"Standard","unstructured":"Standard Performance Evaluation Corporation. SPEC CPU2000 V1.3. http:\/\/www.spec.org\/cpu2000\/. Standard Performance Evaluation Corporation. SPEC CPU2000 V1.3. http:\/\/www.spec.org\/cpu2000\/."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800229.806957"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/229542.229546"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes In Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-71229-9_8","volume-title":"Compiler Construction","author":"Grund Daniel","year":"2007","unstructured":"Daniel Grund and Sebastian Hack . A Fast Cutting-Plane Algorithm for Optimal Coalescing . In Shriram Krishnamurthi and Martin Odersky, editors, Compiler Construction , volume 4420 of Lecture Notes In Computer Science , pages 111 -- 115 , March 2007 . Daniel Grund and Sebastian Hack. A Fast Cutting-Plane Algorithm for Optimal Coalescing. In Shriram Krishnamurthi and Martin Odersky, editors, Compiler Construction, volume 4420 of Lecture Notes In Computer Science, pages 111--115, March 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11688839_20"},{"key":"e_1_3_2_1_15_1","unstructured":"The libFirm Compiler. http:\/\/www.libfirm.org.  The libFirm Compiler. http:\/\/www.libfirm.org."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/353926.353929"},{"key":"e_1_3_2_1_18_1","volume-title":"Building an Optimizing Compiler","author":"Morgan Robert","year":"1998","unstructured":"Robert Morgan . Building an Optimizing Compiler . Digital Press , Newton, MA, USA , 1998 . Robert Morgan. Building an Optimizing Compiler. Digital Press, Newton, MA, USA, 1998."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134007"},{"key":"e_1_3_2_1_20_1","volume-title":"Server Compiler. In Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM '01)","author":"Paleczny Michael","year":"2001","unstructured":"Michael Paleczny , Christopher Vick , and Cliff Click . The Java HotSpot? Server Compiler. In Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM '01) , April 2001 . Michael Paleczny, Christopher Vick, and Cliff Click. The Java HotSpot? Server Compiler. In Proceedings of the Java Virtual Machine Research and Technology Symposium (JVM '01), April 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011508.1011512"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_21"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178251"}],"event":{"name":"PLDI '08: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Tucson AZ USA","acronym":"PLDI '08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375581.1375610","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1375581.1375610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:17Z","timestamp":1750243637000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375581.1375610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,7]]},"references-count":21,"alternative-id":["10.1145\/1375581.1375610","10.1145\/1375581"],"URL":"https:\/\/doi.org\/10.1145\/1375581.1375610","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1379022.1375610","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,6,7]]},"assertion":[{"value":"2008-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}