{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T15:45:51Z","timestamp":1783439151702,"version":"3.54.6"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T00:00:00Z","timestamp":1749081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"crossref","award":["4020180"],"award-info":[{"award-number":["4020180"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2025,7,31]]},"abstract":"<jats:p>\n            Existing debugging and correction approaches suffer from weaknesses such as scalability, reproducing new bugs, and lacking a strategy to deal with multiple bugs. Hence, this article proposes FixRTL, a fully automated scalable methodology for localizing and correcting multiple bugs in Register-Transfer level (RTL) designs. FixRTL consists of three phases: (1)\n            <jats:italic>Constructing Samples<\/jats:italic>\n            , (2)\n            <jats:italic>Debugging<\/jats:italic>\n            , and (3)\n            <jats:italic>Correction<\/jats:italic>\n            . First, we simulate the design under verification (DUV), extract coverage data, and construct our samples. Since we are looking for buggy hit-statements, we use the proposed feature burst (FB) clustering algorithm in the\n            <jats:italic>Debugging Phase<\/jats:italic>\n            . The algorithm applies samples as train data, categorizes the encoded hit-statements into bursts, and uses them as test data to predict their cluster. Then we rank hit-statements based on their probability of containing bugs per cluster. In the\n            <jats:italic>Correction Phase<\/jats:italic>\n            , we apply a proposed mutation-based framework to correct high-ranked hit-statements. The results show that FixRTL reduces the percentage of hit-statements that must be examined to localize bugs on average by 44.3%. The results also demonstrate that FixRTL corrects 67% of injected bugs while recent existing works correct up to 25%. Moreover, unlike recent works, FixRTL offers corrections that match the grand truth.\n          <\/jats:p>","DOI":"10.1145\/3733238","type":"journal-article","created":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T11:23:46Z","timestamp":1746012226000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["FixRTL: Auto-correction of Multiple RTL Bugs by a New Feature Burst Clustering Algorithm and Mutation"],"prefix":"10.1145","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4030-0775","authenticated-orcid":false,"given":"Mahsa","family":"Heidari","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran 14399-57131, Iran (the Islamic Republic of)"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4436-4597","authenticated-orcid":false,"given":"Bijan","family":"Alizadeh","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, College of Engineering, University of Tehran, Tehran 14399-57131, Iran (the Islamic Republic of) and School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran 19538-33511, Iran (the Islamic Republic of)"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,5]]},"reference":[{"key":"e_1_3_1_2_2","article-title":"2022 Wilson research group functional verification study: IC\/ASIC functional verification trend re- port","author":"Foster H.","year":"2022","unstructured":"H. Foster. 2022. 2022 Wilson research group functional verification study: IC\/ASIC functional verification trend re- port. Wilson Research Group and Mentor, A Siemens Business, White Paper. (2022). Retrieved February 2022 from https:\/\/resources.sw.siemens.com\/en-US\/white-paper-2022-wilson-research-group-functional-verification","journal-title":"Wilson Research Group and Mentor, A Siemens Business, White Paper"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3672559"},{"issue":"12","key":"e_1_3_1_4_2","first-page":"3063","article-title":"Incremental SAT-based correction of gate level circuits by reusing partially corrected circuits","volume":"67","author":"Alizadeh B.","year":"2020","unstructured":"B. Alizadeh and A. Yasaman. 2020. Incremental SAT-based correction of gate level circuits by reusing partially corrected circuits. IEEE Transactions on Circuits and Systems II: Express Briefs 67, 12 (2020), 3063\u20133067.","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247789"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3058302"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/NILES53778.2021.9600485"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3108704"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2921374"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2999544"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2023.04.001"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/SERE.2012.12"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.1509"},{"key":"e_1_3_1_14_2","first-page":"1","article-title":"Fault localization analysis based on deep neural network","author":"Zheng W.","year":"2016","unstructured":"W. Zheng, D. Hu, and J. Wang. 2016. Fault localization analysis based on deep neural network. Mathematical Problems in Engineering 2016, 1 (2016), 1\u201311.","journal-title":"Mathematical Problems in Engineering"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2019.8668002"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE43902.2021.00067"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2776912"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2020.106312"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3660526"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247962"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2007.4341472"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2006.1649576"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1996.557150"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507763"},{"key":"e_1_3_1_25_2","unstructured":"H. Ahmad. \u201cgithub \u201d Accessed: 2023. [Online]. Available: Retrieved Agust 2023 from https:\/\/github.com\/hammad-a\/verilog_repair"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3620666.3651346"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2025.3543609"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2022.3217377"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2019.2947231"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/QRS-C.2016.85"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24466-7_9"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85030-2_8"},{"key":"e_1_3_1_33_2","unstructured":"Accessed: 2024. [Online]. Available: Retrieved Januray 2024 from https:\/\/pythonhosted.org\/scikit-fuzzy\/auto_examples\/plot_cmeans.html#data-generation-and-setup"},{"key":"e_1_3_1_34_2","first-page":"1","article-title":"Titan: Enabling large and complex benchmarks in academic CAD","author":"Murray K. E.","year":"2013","unstructured":"K. E. Murray, S. Whitty, S. Liu, J. Luu, and V. Betz. 2013. Titan: Enabling large and complex benchmarks in academic CAD. In 23rd IEEE International Conference on Field Programmable Logic and Applications (2013), 1\u20138.","journal-title":"23rd IEEE International Conference on Field Programmable Logic and Applications"},{"key":"e_1_3_1_35_2","first-page":"213","volume-title":"USENIX Security Symposium","author":"Dessouky G.","year":"2019","unstructured":"G. Dessouky, D. Gens, P. Haney, G. Persyn, A. Kanuparthi, H. Khattri, J. M. Fung, A. Sadeghi, and J. Rajendram. 2019. Hardfails: Insights into software-exploitable hardware bugs. In USENIX Security Symposium (2019), 213\u2013230."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3733238","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3733238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:44Z","timestamp":1750295924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3733238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,5]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7,31]]}},"alternative-id":["10.1145\/3733238"],"URL":"https:\/\/doi.org\/10.1145\/3733238","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,5]]},"assertion":[{"value":"2024-12-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}