{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T15:54:52Z","timestamp":1764172492953,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["PrInt"],"award-info":[{"award-number":["PrInt"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["406377\/ 2018-9"],"award-info":[{"award-number":["406377\/ 2018-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,3,19]]},"DOI":"10.1145\/3497776.3517773","type":"proceedings-article","created":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T17:28:13Z","timestamp":1647624493000},"page":"29-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A polynomial time exact solution to the bit-aware register binding problem"],"prefix":"10.1145","author":[{"given":"Michael","family":"Canesche","sequence":"first","affiliation":[{"name":"Federal University of Minas Gerais, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Ferreira","sequence":"additional","affiliation":[{"name":"Federal University of Vi\u00e7osa, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Augusto","family":"Nacif","sequence":"additional","affiliation":[{"name":"Federal University of Vi\u00e7osa, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0375-1657","authenticated-orcid":false,"given":"Fernando Magno","family":"Quint\u00e3o Pereira","sequence":"additional","affiliation":[{"name":"Federal University of Minas Gerais, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72521-3_21"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.870409"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33182-4_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CASES.2013.6662524"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(81)90048-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.358040"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2005.1466476"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75280"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2004.29"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11560586_17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.025"},{"volume-title":"Vol 57)","author":"Golumbic Martin Charles","key":"e_1_3_2_1_13_1","unstructured":"Martin Charles Golumbic . 2004. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics , Vol 57) . North-Holland Publishing Co. , NLD. isbn:0444515305 Martin Charles Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57). North-Holland Publishing Co., NLD. isbn:0444515305"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2013.6509694"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/WWC.2001.15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11688839_20"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/123186.123350"},{"key":"e_1_3_2_1_18_1","unstructured":"Intel. 2020. Intel High Level Synthesis Compiler Pro Edition. Intel.  Intel. 2020. Intel High Level Synthesis Compiler Pro Edition. Intel."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_59"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2010.5724566"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509420.2509427"},{"key":"e_1_3_2_1_23_1","unstructured":"Fernando Magno Quint\u00e3o Pereira and Michael Canesche. 2022. A Polynomial Time Exact Solution to the Bitwidth-Aware Register Binding Problem (Extended Version). UFMG.  Fernando Magno Quint\u00e3o Pereira and Michael Canesche. 2022. A Polynomial Time Exact Solution to the Bitwidth-Aware Register Binding Problem (Extended Version). UFMG."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_21"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11690634_6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375609"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00722-4_12"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2013.6645550"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/330249.330250"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377555.3377899"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6494996"},{"volume-title":"Compiler Construction","author":"Sarkar Vivek","key":"e_1_3_2_1_32_1","unstructured":"Vivek Sarkar and Rajkishore Barik . 2007. Extended Linear Scan: An Alternate Foundation for Global Register Allocation . In Compiler Construction . Springer, Heidelberg , Germany . 141\u2013155. isbn:9783540712282 https:\/\/doi.org\/10.1.1.94.4590 Vivek Sarkar and Rajkishore Barik. 2007. Extended Linear Scan: An Alternate Foundation for Global Register Allocation. In Compiler Construction. Springer, Heidelberg, Germany. 141\u2013155. isbn:9783540712282 https:\/\/doi.org\/10.1.1.94.4590"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_41"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349317"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(94)90011-6"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604139"},{"key":"e_1_3_2_1_37_1","volume-title":"The Verilog Hardware Description Language","author":"Thomas Donald","unstructured":"Donald Thomas and Philip Moorby . 2008. The Verilog Hardware Description Language ( 5 th ed. ed.). Springer, Carnegie Mellon University (CMU) . isbn:0387849300 Donald Thomas and Philip Moorby. 2008. The Verilog Hardware Description Language (5th ed. ed.). Springer, Carnegie Mellon University (CMU). isbn:0387849300","edition":"5"},{"key":"e_1_3_2_1_38_1","unstructured":"Xilinx. 2018. Vivado Design Suite User Guide. Xilinx.  Xilinx. 2018. Vivado Design Suite User Guide. Xilinx."}],"event":{"name":"CC '22: 31st ACM SIGPLAN International Conference on Compiler Construction","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Seoul South Korea","acronym":"CC '22"},"container-title":["Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497776.3517773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3497776.3517773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:49:26Z","timestamp":1750193366000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497776.3517773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,18]]},"references-count":38,"alternative-id":["10.1145\/3497776.3517773","10.1145\/3497776"],"URL":"https:\/\/doi.org\/10.1145\/3497776.3517773","relation":{},"subject":[],"published":{"date-parts":[[2022,3,18]]},"assertion":[{"value":"2022-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}