{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T20:47:35Z","timestamp":1774039655929,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100010256","name":"Guangzhou Municipal Science and Technology Project","doi-asserted-by":"publisher","award":["2023A03J0013"],"award-info":[{"award-number":["2023A03J0013"]}],"id":[{"id":"10.13039\/501100010256","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62304194"],"award-info":[{"award-number":["62304194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3656246","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["E-Syn: E-Graph Rewriting with Technology-Aware Cost Functions for Logic Synthesis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8825-6260","authenticated-orcid":false,"given":"Chen","family":"Chen","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology(Guangzhou), Guang Zhou, Guang Dong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5077-8361","authenticated-orcid":false,"given":"Guangyu","family":"Hu","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong, Hong Kong Special Administrative Region of China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9346-6383","authenticated-orcid":false,"given":"Dongsheng","family":"Zuo","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), Guang Zhou, Guang Dong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3481-307X","authenticated-orcid":false,"given":"Cunxi","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, Maryland, College Park, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3612-4182","authenticated-orcid":false,"given":"Yuzhe","family":"Ma","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), Guang Zhou, Guang Dong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4001-264X","authenticated-orcid":false,"given":"Hongce","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), Guang Zhou, Guang Dong, China"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Luca Amar\u00fa Pierre-Emmanuel Gaillardon and Giovanni De Micheli. 2015. The EPFL combinational benchmark suite. In IWLS."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"e_1_3_2_1_3_1","volume-title":"ABC: An Academic Industrial-Strength Verification Tool. In Computer Aided Verification","author":"Brayton Robert","year":"2010","unstructured":"Robert Brayton and Alan Mishchenko. 2010. ABC: An Academic Industrial-Strength Verification Tool. In Computer Aided Verification. Springer, 24--40."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. Intl. Symp. Circuits and Systems","author":"Brglez Franc","year":"1985","unstructured":"Franc Brglez. 1985. A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran. In Proc. Intl. Symp. Circuits and Systems, 1985."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2016.04.006"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/54.867894"},{"key":"e_1_3_2_1_7_1","volume-title":"Automatic Datapath Optimization using E-graphs","author":"Coward Samuel","unstructured":"Samuel Coward, George A Constantinides, and Theo Drane. 2022. Automatic Datapath Optimization using E-graphs. In ARITH. IEEE, 43--50."},{"key":"e_1_3_2_1_8_1","volume-title":"Datapath Verification via Word-Level E-Graph Rewriting. arXivL preprint arXiv:2308.00431","author":"Coward Samuel","year":"2023","unstructured":"Samuel Coward, Emiliano Morini, Bryan Tan, Theo Drane, and George Constantinides. 2023. Datapath Verification via Word-Level E-Graph Rewriting. arXivL preprint arXiv:2308.00431 (2023)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Winston Haaswijk Mathias Soeken Luca Amar\u00f9 Pierre-Emmanuel Gaillardon and Giovanni De Micheli. 2017. A novel basis for logic rewriting. In ASP-DAC. 151--156.","DOI":"10.1109\/ASPDAC.2017.7858312"},{"key":"e_1_3_2_1_11_1","unstructured":"Ivo H\u00e1lecek Petr Fiser and Jan Schmidt. 2017. On XAIG Rewriting. In IWLS. 89--96."},{"key":"e_1_3_2_1_12_1","volume-title":"Recent Findings in Boolean Techniques: Selected Papers from the 14th International Workshop on Boolean Problems","author":"Mahzoon Alireza","unstructured":"Alireza Mahzoon, Daniel Gro\u00dfe, and Rolf Drechsler. 2021. GenMul: Generating architecturally complex multipliers to challenge formal verification tools. In Recent Findings in Boolean Techniques: Selected Papers from the 14th International Workshop on Boolean Problems. Springer, 177--191."},{"key":"e_1_3_2_1_13_1","first-page":"15","article-title":"Scalable Logic Synthesis using a Simple Circuit Structure","volume":"6","author":"Mishchenko Alan","year":"2006","unstructured":"Alan Mishchenko and Robert Brayton. 2006. Scalable Logic Synthesis using a Simple Circuit Structure. In IWLS, Vol. 6. 15--22.","journal-title":"IWLS"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Alan Mishchenko Robert Brayton and Stephen Jang. 2010. Global Delay Optimization using Structural Choices. In FPGA. 181--184.","DOI":"10.1145\/1723112.1723144"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Alan Mishchenko Satrajit Chatterjee and Robert Brayton. 2006. DAG-Aware AIG Rewriting a Fresh Look at Combinational Logic Synthesis. In DAC. ACM 532--535.","DOI":"10.1145\/1146909.1147048"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Heinz Riener Siang-Yun Lee Alan Mishchenko and Giovanni De Micheli. 2022. Boolean Rewriting Strikes Back: Reconvergence-Driven Windowing Meets Resynthesis. In ASP-DAC. 395--402.","DOI":"10.1109\/ASP-DAC52403.2022.9712526"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Prianka Sengupta Aakash Tyagi Yiran Chen and Jiang Hu. 2022. How Good Is Your Verilog RTL Code? A Quick Answer from Machine Learning. In ICCAD. 1--9.","DOI":"10.1145\/3508352.3549375"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480915"},{"key":"e_1_3_2_1_19_1","volume-title":"Impress","author":"Ustun Ecenur","year":"2022","unstructured":"Ecenur Ustun, Ismail San, Jiaqi Yin, Cunxi Yu, and Zhiru Zhang. 2022. Impress: Large Integer Multiplication Expression Rewriting for FPGA HLS. In FCCM. IEEE, 1--10."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247948"},{"key":"e_1_3_2_1_21_1","volume-title":"Oliver Flatt, Zachary Tatlock, and Pavel Panchekha.","author":"Willsey Max","year":"2021","unstructured":"Max Willsey, Chandrakana Nandi, Yisu Remy Wang, Oliver Flatt, Zachary Tatlock, and Pavel Panchekha. 2021. Egg: Fast and Extensible Equality Saturation. In POPL, Vol. 5. ACM, New York, NY, USA, 1--29."},{"key":"e_1_3_2_1_22_1","unstructured":"S Yang. 1989. Logic synthesis and optimization benchmarks. In IWLS. 14."},{"key":"e_1_3_2_1_23_1","unstructured":"Saeyang Yang. 1991. Logic synthesis and optimization benchmarks user guide: version 3.0. Citeseer."}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656246","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":23,"alternative-id":["10.1145\/3649329.3656246","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3656246","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}