{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T12:32:04Z","timestamp":1790944324570,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,4,6]],"date-time":"2008-04-06T00:00:00Z","timestamp":1207440000000},"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,4,6]]},"DOI":"10.1145\/1356058.1356064","type":"proceedings-article","created":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T16:27:59Z","timestamp":1207672079000},"page":"35-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Fast liveness checking for ssa-form programs"],"prefix":"10.1145","author":[{"given":"Benoit","family":"Boissinot","sequence":"first","affiliation":[{"name":"ENS Lyon \/ LIP, Universit\u00e9 de Lyon - ENS Lyon - CNRS - Inria - UCBL, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Hack","sequence":"additional","affiliation":[{"name":"INRIA \/ LIP, Universit\u00e9 de Lyon - ENS Lyon - CNRS - Inria - UCBL, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Grund","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Beno\u00eet","family":"Dupont de Dine hin","sequence":"additional","affiliation":[{"name":"STMicroelectronics, Grenoble, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabri e","family":"Rastello","sequence":"additional","affiliation":[{"name":"INRIA \/ LIP, Universit\u00e9 de Lyon - ENS Lyon - CNRS - Inria - UCBL, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,4,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/59287.59293"},{"key":"e_1_3_2_1_2_1","volume-title":"Appel and Jens Palsberg. Modern Compiler Implementation in Java","author":"Andrew","year":"2002","unstructured":"Andrew W. Appel and Jens Palsberg. Modern Compiler Implementation in Java . Cambridge University Press , second edition, 2002 . Andrew W. Appel and Jens Palsberg. Modern Compiler Implementation in Java. Cambridge University Press, second edition, 2002."},{"key":"e_1_3_2_1_3_1","volume-title":"The 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? In The 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC'06) , November 2 --4 , 2006 , New Orleans, Louisiana, LNCS. Springer Verlag, 2006. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove? In The 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), November 2--4, 2006, New Orleans, Louisiana, LNCS. Springer Verlag, 2006."},{"key":"e_1_3_2_1_4_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_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176484"},{"key":"e_1_3_2_1_6_1","volume-title":"Majid Sarrafzadeh. Polynomial Time Graph Coloring Register Allocation. In 14th International Workshop on Logic and Synthesis. ACM Press","author":"Brisk Philip","year":"2005","unstructured":"Philip Brisk , Foad Dabiri , Jamie Macbeth , and Majid Sarrafzadeh. Polynomial Time Graph Coloring Register Allocation. In 14th International Workshop on Logic and Synthesis. ACM Press , 2005 . Philip Brisk, Foad Dabiri, Jamie Macbeth, and Majid Sarrafzadeh. Polynomial Time Graph Coloring Register Allocation. In 14th International Workshop on Logic and Synthesis. ACM Press, 2005."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512534"},{"key":"e_1_3_2_1_9_1","volume-title":"Morgan Kaufmann","author":"Keith","year":"2004","unstructured":"Keith D. Cooper and Linda Torczon. Engineering a Compiler . Morgan Kaufmann , 2004 . Keith D. Cooper and Linda Torczon. Engineering a Compiler. Morgan Kaufmann, 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1786054.1786068"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/354880.354894"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/262004.262005"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321835"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301667"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_21"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349330"},{"key":"e_1_3_2_1_21_1","first-page":"194","volume-title":"Vatsa Santhanam. Translating Out of Static Single Assignment Form. In SAS '99: Proceedings of the 6th International Symposium on Static Analysis","author":"Sreedhar Vugranam C.","year":"1999","unstructured":"Vugranam C. Sreedhar , Roy Dz-- Ching Ju , David M. Gillies , and Vatsa Santhanam. Translating Out of Static Single Assignment Form. In SAS '99: Proceedings of the 6th International Symposium on Static Analysis , pages 194 --- 210 , London, UK , 1999 . Springer--Verlag. Vugranam C. Sreedhar, Roy Dz--Ching Ju, David M. Gillies, and Vatsa Santhanam. Translating Out of Static Single Assignment Form. In SAS '99: Proceedings of the 6th International Symposium on Static Analysis, pages 194---210, London, UK, 1999. Springer--Verlag."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"}],"event":{"name":"CGO '08: 6th Annual IEEE \/ ACM International Symposium on Code Generation and Optimization","location":"Boston MA USA","acronym":"CGO '08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 6th annual IEEE\/ACM international symposium on Code generation and optimization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1356058.1356064","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1356058.1356064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:09Z","timestamp":1750253949000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1356058.1356064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,6]]},"references-count":19,"alternative-id":["10.1145\/1356058.1356064","10.1145\/1356058"],"URL":"https:\/\/doi.org\/10.1145\/1356058.1356064","relation":{},"subject":[],"published":{"date-parts":[[2008,4,6]]},"assertion":[{"value":"2008-04-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}