{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:06Z","timestamp":1750307706935,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,19]],"date-time":"2008-10-19T00:00:00Z","timestamp":1224374400000},"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,10,19]]},"DOI":"10.1145\/1450095.1450119","type":"proceedings-article","created":{"date-parts":[[2008,10,22]],"date-time":"2008-10-22T12:25:44Z","timestamp":1224678344000},"page":"147-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Advanced conservative and optimistic register coalescing"],"prefix":"10.1145","author":[{"given":"Florent","family":"Bouchez","sequence":"first","affiliation":[{"name":"ENS-Lyon, Lyon, France"}]},{"given":"Alain","family":"Darte","sequence":"additional","affiliation":[{"name":"CNRS, Lyon, France"}]},{"given":"Fabrice","family":"Rastello","sequence":"additional","affiliation":[{"name":"Inria, Lyon, France"}]}],"member":"320","published-online":{"date-parts":[[2008,10,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Modern Compiler Implementation in ML","author":"Appel A.","year":"1998","unstructured":"A. Appel . Modern Compiler Implementation in ML . Cambridge University Press , 1998 . A. Appel. Modern Compiler Implementation in ML. Cambridge University Press, 1998."},{"unstructured":"A. Appel and L. George. Coalescing challenge. http:\/\/www.cs.princeton.edu\/~ appel\/coalesce 2000.  A. Appel and L. George. Coalescing challenge. http:\/\/www.cs.princeton.edu\/~ appel\/coalesce 2000.","key":"e_1_3_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/378795.378854"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/CGO.2007.26"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/177492.177575"},{"key":"e_1_3_2_1_9_1","volume-title":"14th International Workshop on Logic and Synthesis","author":"Brisk P.","year":"2005","unstructured":"P. Brisk , F. Dabiri , J. Macbeth , and M. Sarrafzadeh . Polynomial time graph coloring register allocation . In 14th International Workshop on Logic and Synthesis , June 2005 . P. Brisk, F. Dabiri, J. Macbeth, and M. Sarrafzadeh. Polynomial time graph coloring register allocation. In 14th International Workshop on Logic and Synthesis, June 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.5555\/2245737.2245881"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/115372.115320"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/229542.229546"},{"key":"e_1_3_2_1_13_1","volume-title":"Academic Press","author":"Golumbic M. C.","year":"1980","unstructured":"M. C. Golumbic . Algorithmic Graph Theory and Perfect Graphs . Academic Press , New York , 1980 . M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"e_1_3_2_1_14_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 D.","year":"2007","unstructured":"D. Grund and S. Hack . A fast cutting-plane algorithm for optimal coalescing . In S. Krishnamurthi and M. Odersky, editors, Compiler Construction 2007 , volume 4420 of Lecture Notes In Computer Science , pages 111 -- 125 . Springer , March 2007. Braga, Portugal. D. Grund and S. Hack. A fast cutting-plane algorithm for optimal coalescing. In S. Krishnamurthi and M. Odersky, editors, Compiler Construction 2007, volume 4420 of Lecture Notes In Computer Science, pages 111--125. Springer, March 2007. Braga, Portugal."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/11688839_20"},{"key":"e_1_3_2_1_16_1","volume-title":"A new MLRISC register allocator. Technical report","author":"Leung A.","year":"1999","unstructured":"A. Leung and L. George . A new MLRISC register allocator. Technical report , New York University , 1999 . A. Leung and L. George. A new MLRISC register allocator. Technical report, New York University, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1011508.1011512"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/11575467_21"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.5555\/977395.977678"},{"doi-asserted-by":"crossref","unstructured":"V. C.\n      Sreedhar R. D.\n      Ju D. M.\n      Gillies and \n      V.\n      Santhanam\n  . \n  Translating out of static single assignment form\n  . In A. Cortesi and G. Fil\u00e9 editors 6th international Symposium on Static Analysis volume \n  1694\n   of \n  LNCS pages \n  194\n  --\n  210\n  . \n  Springer Verlag 1999\n  .   V. C. Sreedhar R. D. Ju D. M. Gillies and V. Santhanam. Translating out of static single assignment form. In A. Cortesi and G. Fil\u00e9 editors 6th international Symposium on Static Analysis volume 1694 of LNCS pages 194--210. Springer Verlag 1999.","key":"e_1_3_2_1_20_1","DOI":"10.1007\/3-540-48294-6_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/301618.301657"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGBED ACM Special Interest Group on Embedded Systems","SIGDA ACM Special Interest Group on Design Automation","SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"],"acronym":"ESWEEK 08","name":"ESWEEK 08: Fourth Embedded Systems Week","location":"Atlanta GA USA"},"container-title":["Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1450095.1450119","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1450095.1450119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:07Z","timestamp":1750253407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1450095.1450119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,19]]},"references-count":18,"alternative-id":["10.1145\/1450095.1450119","10.1145\/1450095"],"URL":"https:\/\/doi.org\/10.1145\/1450095.1450119","relation":{},"subject":[],"published":{"date-parts":[[2008,10,19]]},"assertion":[{"value":"2008-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}