{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T18:43:43Z","timestamp":1790275423253,"version":"4.1.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tcad.2024.3483096","type":"journal-article","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T13:37:49Z","timestamp":1729172269000},"page":"1366-1379","source":"Crossref","is-referenced-by-count":8,"title":["Constraint-Aware E-Graph Rewriting for Hardware Performance Optimization"],"prefix":"10.1109","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7741-3271","authenticated-orcid":false,"given":"Samuel","family":"Coward","sequence":"first","affiliation":[{"name":"Numerical Hardware Group, Intel Corporation, Folsom, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6488-5440","authenticated-orcid":false,"given":"Theo","family":"Drane","sequence":"additional","affiliation":[{"name":"Numerical Hardware Group, Intel Corporation, Folsom, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0201-310X","authenticated-orcid":false,"given":"George A.","family":"Constantinides","sequence":"additional","affiliation":[{"name":"Department of Electronic and Electrical Engineering, Imperial College London, London, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480915"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3434304"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH54963.2022.00016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM53951.2022.9786123"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3485496"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3460946.3464316"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2012.2188955"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1999.762826"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247797"},{"key":"ref10","article-title":"Techniques for program verification","author":"Nelson","year":"1980"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73595-3_13"},{"issue":"3","key":"ref12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/1066100.1066102","article-title":"Simplify: A theorem prover for program checking","volume":"52","author":"Detlefs","year":"2005","journal-title":"J. ACM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3589250.3596144"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.34727\/2022\/isbn.978-3-85448-053-2_13"},{"key":"ref15","first-page":"337","article-title":"Z3: An efficient SMT solver","volume-title":"Proc. Int. Conf. Tools Algorithm. Construct. Anal. Syst.","author":"De Moura"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2813885.2737959"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247948"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF59524.2023.10476812"},{"key":"ref19","first-page":"1","article-title":"SEER: Super-optimization explorer for HLS using E-graph rewriting with MLIR","volume-title":"Proc. 29th ACM Int. Conf. Archit. Support Program. Lang. Oper. Syst.","author":"Cheng"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2024.3410154"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.34727\/2024\/isbn.978-3-85448-065-5_13"},{"key":"ref22","volume-title":"Engineering a Compiler","author":"Cooper","year":"2011"},{"key":"ref23","volume-title":"Principles of Abstract Interpretation","author":"Cousot","year":"2021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"issue":"1","key":"ref25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1644001.1644003","article-title":"Certification of bounds on expressions involving rounded operators","volume":"37","author":"Daumas","year":"2010","journal-title":"ACM Trans. Math. Softw."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2019.00016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2009.28"},{"key":"ref28","volume-title":"Coding Guidelines for Datapath Synthesis","year":"2019"},{"key":"ref29","volume-title":"Automatic sequential clock gating with PowerPro","year":"2021"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2003280"},{"key":"ref31","volume-title":"Voss II","author":"Seger","year":"2023"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FDL59689.2023.10272129"},{"key":"ref33","volume-title":"Slang","author":"Popoloski","year":"2023"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH61463.2024.00014"},{"key":"ref35","volume-title":"The Verilog\u00ae Hardware Description Language","author":"Thomas","year":"2008"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-42808-1","volume-title":"Application-Specific Arithmetic","author":"de Dinechin","year":"2024"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2001.930122"},{"key":"ref38","doi-asserted-by":"crossref","DOI":"10.1201\/9781315275567","volume-title":"Computer Arithmetic Algorithms","author":"Koren","year":"2018"},{"key":"ref39","volume-title":"Coin-or\/Cbc: Release releases\/2.10.10","author":"Forrest","year":"2023"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2003.1292036"},{"key":"ref41","article-title":"Towards relational contextual equality saturation","volume-title":"EGRAPHS workshop","author":"Hou"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/43\/10934961\/10720856.pdf?arnumber=10720856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T14:24:38Z","timestamp":1742826278000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10720856\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":41,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2024.3483096","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}