{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:33Z","timestamp":1750306893244,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T00:00:00Z","timestamp":1360540800000},"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":[[2013,2,11]]},"DOI":"10.1145\/2435264.2435285","type":"proceedings-article","created":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T14:15:17Z","timestamp":1360678517000},"page":"105-114","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Word-length optimization beyond straight line code"],"prefix":"10.1145","author":[{"given":"David P.","family":"Boland","sequence":"first","affiliation":[{"name":"Imperial College London, London, United Kingdom"}]},{"given":"George A.","family":"Constantinides","sequence":"additional","affiliation":[{"name":"Imperial College London, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2013,2,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2161307"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145694.2145726"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1155\/2010\/171027"},{"key":"e_1_3_2_1_4_1","first-page":"612","volume-title":"Proc. Int. Symp. on Circuits and Systems","volume":"2","author":"Cantin M.-A.","unstructured":"M.-A. Cantin , Y. Savaria , and P. Lavoie . A comparison of automatic word length optimization procedures . In Proc. Int. Symp. on Circuits and Systems , volume 2 , pages II-- 612 -- II--615 vol.2, 2002. M.-A. Cantin, Y. Savaria, and P. Lavoie. A comparison of automatic word length optimization procedures. In Proc. Int. Symp. on Circuits and Systems, volume 2, pages II--612 -- II--615 vol.2, 2002."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2001.921982"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025123.1025816"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777259.1777262"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1058426.1058868"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/795660.795947"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2011.48"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_19"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1941487.1941509"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.128"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27705-4_21"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647929.740393"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms. Soc for Industrial & Applied Math","author":"Higham N. J.","year":"2002","unstructured":"N. J. Higham . Accuracy and Stability of Numerical Algorithms. Soc for Industrial & Applied Math , Philadelphia, PA, USA , second edition, 2002 . N. J. Higham. Accuracy and Stability of Numerical Algorithms. Soc for Industrial & Applied Math, Philadelphia, PA, USA, second edition, 2002."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837339"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.936374"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.873887"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065799"},{"key":"e_1_3_2_1_23_1","first-page":"402","volume-title":"Proc. Int. Conf. on Computer Science and Information Technology","author":"Li Y.","year":"2009","unstructured":"Y. Li . Automatic discovery of non-linear ranking functions of loop programs . In Proc. Int. Conf. on Computer Science and Information Technology , pages 402 -- 406 , 2009 . Y. Li. Automatic discovery of non-linear ranking functions of loop programs. In Proc. Int. Conf. on Computer Science and Information Technology, pages 402 --406, 2009."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2007.4380730"},{"key":"e_1_3_2_1_25_1","volume-title":"Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B, 96(2--3):293--320","author":"Parrilo P. A.","year":"2003","unstructured":"P. A. Parrilo . Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B, 96(2--3):293--320 , 2003 . P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B, 96(2--3):293--320, 2003."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69611-7_16"},{"key":"e_1_3_2_1_28_1","first-page":"31","volume-title":"Proc. Workshop on RTL and High Level Testing.","author":"S\u00fclfow A.","year":"2007","unstructured":"A. S\u00fclfow , U. K\u00fchne , R. Wille , D. Gro\u00dfe , and R. Drechsler . Evaluation of sat like proof techniques for formal verification of word level circuits . In Proc. Workshop on RTL and High Level Testing. , pages 31 --- 36 , 2007 . A. S\u00fclfow, U. K\u00fchne, R. Wille, D. Gro\u00dfe, and R. Drechsler. Evaluation of sat like proof techniques for formal verification of word level circuits. In Proc. Workshop on RTL and High Level Testing., pages 31---36, 2007."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.476465"}],"event":{"name":"FPGA '13: The 2013 ACM\/SIGDA International Symposium on Field Programmable Gate Arrays","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"FPGA '13"},"container-title":["Proceedings of the ACM\/SIGDA international symposium on Field programmable gate arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2435264.2435285","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2435264.2435285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:56Z","timestamp":1750234736000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2435264.2435285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,11]]},"references-count":29,"alternative-id":["10.1145\/2435264.2435285","10.1145\/2435264"],"URL":"https:\/\/doi.org\/10.1145\/2435264.2435285","relation":{},"subject":[],"published":{"date-parts":[[2013,2,11]]},"assertion":[{"value":"2013-02-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}