{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:46Z","timestamp":1750219966602,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"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":[[2023,5,9]]},"DOI":"10.1145\/3587135.3591438","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T10:22:41Z","timestamp":1691144561000},"page":"393-394","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["ErrorEval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0341-421X","authenticated-orcid":false,"given":"Morteza","family":"Rezaalipour","sequence":"first","affiliation":[{"name":"Universit\u00e0 della Svizzera italiana (USI), Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8935-6796","authenticated-orcid":false,"given":"Lorenzo","family":"Ferretti","sequence":"additional","affiliation":[{"name":"Micron Technology, San Jose, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1887-0779","authenticated-orcid":false,"given":"Ilaria","family":"Scarabottolo","sequence":"additional","affiliation":[{"name":"Universit\u00e0 della Svizzera italiana (USI), Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0201-310X","authenticated-orcid":false,"given":"George A.","family":"Constantinides","sequence":"additional","affiliation":[{"name":"Imperial College London, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1083-8782","authenticated-orcid":false,"given":"Laura","family":"Pozzi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 della Svizzera italiana (USI), Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3014430"},{"key":"e_1_3_2_1_2_1","first-page":"667","volume-title":"MACACO: Modeling and analysis of circuits for approximate computing","author":"Venkatesan R.","year":"2011","unstructured":"R. Venkatesan, A. Agarwal, K. Roy, and A. Raghunathan, \"MACACO: Modeling and analysis of circuits for approximate computing,\" pp. 667--673, Nov. 2011."},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Approximation-aware rewriting of AIGs for error tolerant applications","author":"Chandrasekharan A.","year":"2016","unstructured":"A. Chandrasekharan, M. Soeken, D. Gro\u00dfe, and R. Drechsler, \"Approximation-aware rewriting of AIGs for error tolerant applications,\" pp. 1--8, Nov. 2016."},{"issue":"12","key":"e_1_3_2_1_4_1","first-page":"177309","article-title":"Formal methods for exact analysis of approximate circuits","volume":"7","author":"Vasicek Z.","year":"2022","unstructured":"Z. Vasicek, \"Formal methods for exact analysis of approximate circuits,\" IEEE Access, vol. 7, no. 12, pp. 177309--177331, 2022.","journal-title":"IEEE Access"},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"BLASYS: Approximate logic synthesis using boolean matrix factorization","author":"Hashemi S.","year":"2018","unstructured":"S. Hashemi, H. Tann, and S. Reda, \"BLASYS: Approximate logic synthesis using boolean matrix factorization,\" pp. 1--6, June 2018."},{"key":"e_1_3_2_1_6_1","first-page":"545","volume-title":"Circuit Carving: A methodology for the design of approximate hardware","author":"Scarabottolo I.","year":"2018","unstructured":"I. Scarabottolo, G. Ansaloni, and L. Pozzi, \"Circuit Carving: A methodology for the design of approximate hardware,\" pp. 545--550, Mar. 2018."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2657799"}],"event":{"name":"CF '23: 20th ACM International Conference on Computing Frontiers","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"],"location":"Bologna Italy","acronym":"CF '23"},"container-title":["Proceedings of the 20th ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3587135.3591438","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3587135.3591438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:13Z","timestamp":1750182553000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3587135.3591438"}},"subtitle":["an Open-Source Worst-Case-Error Evaluation Framework for Approximate Computing"],"short-title":[],"issued":{"date-parts":[[2023,5,9]]},"references-count":7,"alternative-id":["10.1145\/3587135.3591438","10.1145\/3587135"],"URL":"https:\/\/doi.org\/10.1145\/3587135.3591438","relation":{},"subject":[],"published":{"date-parts":[[2023,5,9]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}