{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:16:23Z","timestamp":1775873783656,"version":"3.50.1"},"reference-count":79,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T00:00:00Z","timestamp":1738886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key R&D Program","award":["2022YFB4501801"],"award-info":[{"award-number":["2022YFB4501801"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272218"],"award-info":[{"award-number":["62272218"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Frontier Technologies R&D Program of Jiangsu","award":["BF2024059"],"award-info":[{"award-number":["BF2024059"]}]},{"name":"Collaborative Innovation Center of Novel Software Technology and Industrialization, Jiangsu, China"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>\n            The landscape of Verilog toolchains for electronic design automation (EDA) is diverse, and their reliability is crucial, as errors can lead to significant debugging challenges and delays in development. Methodologies such as testing and formal verification have been applied to identify and eliminate defects in these toolchains. We propose a framework named\n            <jats:sc>VeriXmith<\/jats:sc>\n            to interconnect design tools involved in logical synthesis and simulation for cross-checking. These tools process circuit designs and produce outputs in different languages, such as Verilog netlists from synthesizers and C++ programs from simulators. Since these outputs represent the same circuit semantics, we can leverage this semantic consistency to verify the tools that translate one representation into another. Our approach involves creating semantics extractors to extend the range of circuit representations available for semantic equivalence checking by converting them into a canonical and comparable form. Additionally, we develop mutation operators for Verilog designs to introduce new data\/control paths and language constructs, enhancing the diversity of circuit designs as test inputs. By validating semantic equivalence, our framework successfully identifies defects in existing Verilog toolchains. An exploratory experiment uncovers 31 previously unknown bugs in well-known open-source Verilog tools, including Verilator and Yosys.\n          <\/jats:p>","DOI":"10.1145\/3715325","type":"journal-article","created":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T11:01:11Z","timestamp":1738062071000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Unveiling Cross-checking Opportunities in Verilog Compilers"],"prefix":"10.1145","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8783-8686","authenticated-orcid":false,"given":"Yike","family":"Zhou","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7651-9560","authenticated-orcid":false,"given":"Yanyan","family":"Jiang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1166-6927","authenticated-orcid":false,"given":"Jian","family":"Lu","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","unstructured":"2005. IEC\/IEEE International Standard - Verilog(R) Register Transfer Level Synthesis. IEEE. Retrieved from 10.1109\/IEEESTD.2005.339572","DOI":"10.1109\/IEEESTD.2005.339572"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","unstructured":"2006. IEEE Standard for Verilog Hardware Description Language. IEEE. Retrieved from 10.1109\/IEEESTD.2006.99495","DOI":"10.1109\/IEEESTD.2006.99495"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","unstructured":"2018. IEEE Standard for SystemVerilog\u2013Unified Hardware Design Specification and Verification Language. IEEE. Retrieved from 10.1109\/IEEESTD.2018.8299595","DOI":"10.1109\/IEEESTD.2018.8299595"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","unstructured":"2020. IEEE Standard for Universal Verification Methodology Language Reference Manual. IEEE. Retrieved from 10.1109\/IEEESTD.2020.9195920","DOI":"10.1109\/IEEESTD.2020.9195920"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228584"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","unstructured":"Kunal Banerjee Chandan Karfa Dipankar Sarkar and Chittaranjan Mandal. 2014. Verification of code motion techniques using value propagation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33 8 (2014) 1180\u20131193. DOI:10.1109\/TCAD.2014.2314392","DOI":"10.1109\/TCAD.2014.2314392"},{"key":"e_1_3_3_8_2","volume-title":"The SMT-LIB Standard: Version 2.6","author":"Barrett Clark","year":"2017","unstructured":"Clark Barrett, Pascal Fontaine, and Cesare Tinelli. 2017. The SMT-LIB Standard: Version 2.6. Technical Report. Department of Computer Science, The University of Iowa. Available at www.SMT-LIB.org."},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.5555\/646483.691738"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_14"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","unstructured":"Bryant. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35 8 (1986) 677\u2013691.","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","unstructured":"J. R. Burch E. M. Clarke D. E. Long K. L. McMillan and D. L. Dill. 1994. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13 4 (1994) 401\u2013424. DOI:10.1109\/43.275352","DOI":"10.1109\/43.275352"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","unstructured":"J. R. Burch E. M. Clarke K. L. McMillan D. L. Dill and L. J. Hwang. 1992. Symbolic model checking: 1020 States and beyond. Information and Computation 98 2 (1992) 142\u2013170. DOI:10.1016\/0890-5401(92)90017-A","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"e_1_3_3_15_2","series-title":"OSDI\u201908","first-page":"209","volume-title":"Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, and Dawson Engler. 2008. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation (OSDI\u201908). USENIX Association, USA, 209\u2013224."},{"key":"e_1_3_3_16_2","unstructured":"Cadence. 2024. Logic Equivalence Checking. (2024). Retrieved January 30 2025 from https:\/\/www.cadence.com\/en_US\/home\/tools\/digital-design-and-signoff\/logic-equivalence-checking.html"},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","unstructured":"Junjie Chen Jibesh Patra Michael Pradel Yingfei Xiong Hongyu Zhang Dan Hao and Lu Zhang. 2020. A survey of compiler testing. ACM Computing Surveys 53 1 Article 4 (2020) 36 pages.","DOI":"10.1145\/3363562"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","unstructured":"Qinlin Chen Nairen Zhang Jinpeng Wang Tian Tan Chang Xu Xiaoxing Ma and Yue Li. 2023. The essence of verilog: A tractable and tested operational semantics for verilog. Proceedings of the ACM on Programming Languages 7 OOPSLA2 Article 230 (2023) 30 pages. DOI:10.1145\/3622805","DOI":"10.1145\/3622805"},{"key":"e_1_3_3_19_2","unstructured":"chipsalliance. 2024. synlig. (2024). Retrieved January 30 2025 from https:\/\/github.com\/chipsalliance\/synlig"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","unstructured":"Ramanuj Chouksey and Chandan Karfa. 2020. Verification of scheduling of conditional behaviors in high-level synthesis. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 28 7 (2020) 1638\u20131651. DOI:10.1109\/TVLSI.2020.2978242","DOI":"10.1109\/TVLSI.2020.2978242"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","unstructured":"Ramanuj Chouksey Chandan Karfa and Purandar Bhaduri. 2019. Translation validation of code motion transformations involving loops. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 38 7 (2019) 1378\u20131382. DOI:10.1109\/TCAD.2018.2846654","DOI":"10.1109\/TCAD.2018.2846654"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/775832.775928"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3678722.3685536"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","unstructured":"Philippe Coussy Daniel D. Gajski Michael Meredith and Andres Takach. 2009. An introduction to high-level synthesis. IEEE Design and Test of Computers 26 4 (2009) 8\u201317. DOI:10.1109\/MDT.2009.69","DOI":"10.1109\/MDT.2009.69"},{"key":"e_1_3_3_25_2","series-title":"WOSET","volume-title":"Proceedings of the Workshop on Open-Source EDA Technology","author":"Dargelas Alain","year":"2020","unstructured":"Alain Dargelas and Henner Zeller. 2020. Universal hardware data model. In Proceedings of the Workshop on Open-Source EDA Technology (WOSET)."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","unstructured":"Andrew Dobis Kevin Laeufer Hans Jakob Damsgaard Tjark Petersen Kasper Juul Hesse Rasmussen Enrico Tolotto Simon Thye Andersen Richard Lin and Martin Schoeberl. 2023. Verification of chisel hardware designs with ChiselVerify. Microprocessors and Microsystems 96 (2023) 104737. DOI:10.1016\/j.micpro.2022.104737","DOI":"10.1016\/j.micpro.2022.104737"},{"key":"e_1_3_3_28_2","volume-title":"Proceedings of the Workshop on Open-Source EDA Technology (WOSET\u201921)","author":"Eldridge Schuyler","year":"2021","unstructured":"Schuyler Eldridge, Prithayan Barua, Aliaksei Chapyzhenka, Adam Izraelevitz, Jack Koenig, Chris Lattner, Andrew Lenharth, George Leontiev, Fabian Schuiki, Ram Sunder, et\u00a0al. 2021. MLIR as hardware compiler infrastructure. In Proceedings of the Workshop on Open-Source EDA Technology (WOSET\u201921)."},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598130"},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","unstructured":"Peter Flake Phil Moorby Steve Golson Arturo Salz and Simon Davidmann. 2020. Verilog HDL and its ancestors and descendants. Proceedings of the ACM on Programming Languages 4 HOPL Article 87(2020) 90 pages.","DOI":"10.1145\/3386337"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/b137175"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2001.915010"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1995.523251"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM51124.2021.00034"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","unstructured":"Yann Herklotz James D. Pollard Nadesh Ramanathan and John Wickerson. 2021. Formal verification of high-level synthesis. Proceedings of the ACM on Programming Languages 5 OOPSLA Article 117(2021) 30 pages. DOI:10.1145\/3485494","DOI":"10.1145\/3485494"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373087.3375310"},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","unstructured":"John E. Hopcroft Rajeev Motwani and Jeffrey D. Ullman. 2001. Introduction to automata theory languages and computation 2nd edition. SIGACT News 32 1(2001) 60\u201365.","DOI":"10.1145\/568438.568455"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203780"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","unstructured":"M. V. Achutha Kiran Kumar Aarti Gupta and S. S. Bindumadhava. 2014. RTL2RTL formal equivalence: Boosting the design confidence. Electronic Proceedings in Theoretical Computer Science 156 (2014) 29\u201344. DOI:10.4204\/eptcs.156.7","DOI":"10.4204\/eptcs.156.7"},{"key":"e_1_3_3_40_2","doi-asserted-by":"crossref","unstructured":"Sudipta Kundu Sorin Lerner and Rajesh K. Gupta. 2010. Translation validation of high-level synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 29 4 (2010) 566\u2013579.","DOI":"10.1109\/TCAD.2010.2042889"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","unstructured":"Charles E. Leiserson and James B. Saxe. 1991. Retiming synchronous circuitry. Algorithmica 6 1(1991) 5\u201335. DOI:10.1007\/BF01759032","DOI":"10.1007\/BF01759032"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","unstructured":"Shaohua Li Theodoros Theodoridis and Zhendong Su. 2024. Boosting compiler testing by injecting real-world code. Proceedings of the ACM on Programming Languages 8 PLDI Article 156 (2024) 23 pages. DOI:10.1145\/3656386","DOI":"10.1145\/3656386"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","unstructured":"Vsevolod Livinskii Dmitry Babokin and John Regehr. 2023. Fuzzing loop optimizations in compilers for c++ and data-parallel languages. Proceedings of the ACM on Programming Languages 7 PLDI Article 181 (2023) 22 pages. DOI:10.1145\/3591295","DOI":"10.1145\/3591295"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437992.3439916"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/MEMOCODE57689.2022.9954591"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3623278.3624767"},{"key":"e_1_3_3_48_2","unstructured":"William M. McKeeman. 1998. Differential testing for software. Digital Technical Journal 10 1 (1998) 100\u2013107."},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2010.5558634"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","unstructured":"M. N. Mneimneh and K. A. Sakallah. 2005. Principles of sequential-equivalence verification. IEEE Design and Test of Computers 22 3 (2005) 248\u2013257. DOI:10.1109\/MDT.2005.68","DOI":"10.1109\/MDT.2005.68"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","unstructured":"Changhai Nie and Hareton Leung. 2011. A survey of combinatorial testing. ACM Computing Surveys 43 2 Article 11 (2011) 29 pages. DOI:10.1145\/1883612.1883618","DOI":"10.1145\/1883612.1883618"},{"key":"e_1_3_3_52_2","volume-title":"Proceedings of the Design and Verification Conference Europe (DVCon Europe\u201924)","author":"Pardalos Michalis","year":"2024","unstructured":"Michalis Pardalos, Alastair F. Donaldson, Emiliano Morini, Laura Pozzi, and John Wickerson. 2024. Who checks the checkers? Automatically finding bugs in C-to-RTL formal equivalence checkers. In Proceedings of the Design and Verification Conference Europe (DVCon Europe\u201924)."},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3380446.3430634"},{"key":"e_1_3_3_54_2","volume-title":"Proceedings of the 41st International Conference on Machine Learning","author":"PEI Zehua","year":"2024","unstructured":"Zehua PEI, Huiling Zhen, Mingxuan Yuan, Yu Huang, and Bei Yu. 2024. BetterV: Controlled verilog generation with discriminative guidance. In Proceedings of the 41st International Conference on Machine Learning. https:\/\/openreview.net\/forum?id=jKnW7r7de1"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054170"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.23919\/FPL.2017.8056858"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/611817.611837"},{"key":"e_1_3_3_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386024"},{"key":"e_1_3_3_59_2","doi-asserted-by":"publisher","unstructured":"Carl-Johan H. Seger and Randal E. Bryant. 1995. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design 6 2(1995) 147\u2013189. DOI:10.1007\/BF01383966","DOI":"10.1007\/BF01383966"},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/513918.513951"},{"key":"e_1_3_3_61_2","unstructured":"Wilson Snyder. 2024. Verilator. (2024). Retrieved January 30 2025 from https:\/\/www.veripool.org\/verilator\/"},{"key":"e_1_3_3_62_2","unstructured":"steveicarus. 2024. iverilog. (2024). Retrieved January 30 2025 from https:\/\/github.com\/steveicarus\/iverilog"},{"key":"e_1_3_3_63_2","unstructured":"Synopsys. 2024. Equivalence Checking and Synopsys. (2024). Retrieved January 30 2025 from https:\/\/www.synopsys.com\/glossary\/what-is-equivalence-checking.html#e"},{"key":"e_1_3_3_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-33-4642-0"},{"key":"e_1_3_3_65_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE56975.2023.10137086"},{"key":"e_1_3_3_66_2","doi-asserted-by":"publisher","unstructured":"Shailja Thakur Baleegh Ahmad Hammond Pearce Benjamin Tan Brendan Dolan-Gavitt Ramesh Karri and Siddharth Garg. 2024. VeriGen: A large language model for verilog code generation. ACM Transactions on Design Automation of Electronic Systems 29 3 Article 46 (2024) 31 pages. DOI:10.1145\/3643681","DOI":"10.1145\/3643681"},{"key":"e_1_3_3_67_2","unstructured":"tree sitter. 2024. tree-sitter-verilog. (2024). Retrieved January 30 2025 from https:\/\/github.com\/tree-sitter\/tree-sitter-verilog"},{"key":"e_1_3_3_68_2","doi-asserted-by":"publisher","unstructured":"Yakir Vizel Georg Weissenbacher and Sharad Malik. 2015. Boolean satisfiability solvers and their applications in model checking. Proc. IEEE 103 11 (2015) 2021\u20132035. DOI:10.1109\/JPROC.2015.2455034","DOI":"10.1109\/JPROC.2015.2455034"},{"key":"e_1_3_3_69_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2019.00081"},{"key":"e_1_3_3_70_2","unstructured":"whitequark. 2020. Issue 2516 - CXXRTL: Strange Timings and Mismatch in Dumped VCD. (2020). Retrieved January 30 2025 from https:\/\/github.com\/YosysHQ\/yosys\/issues\/2516#issuecomment-752852146"},{"key":"e_1_3_3_71_2","unstructured":"whitequark. 2021. Issue 2780 - CXXRTL Doesn\u2019t Approach Steady State on O4 when Routing Signal via Module. (2021). Retrieved January 30 2025 from https:\/\/github.com\/YosysHQ\/yosys\/issues\/2780#issuecomment-881365712"},{"key":"e_1_3_3_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385985"},{"key":"e_1_3_3_73_2","unstructured":"Claire Wolf. Yosys Open SYnthesis Suite. Retrieved January 30 2025 from https:\/\/yosyshq.net\/yosys\/"},{"key":"e_1_3_3_74_2","unstructured":"Claire Wolf. 2024. SymbiYosys (sby)\u2014Front-end for Yosys-based Formal Verification Flows. (2024). Retrieved January 30 2025 from https:\/\/github.com\/YosysHQ\/sby"},{"key":"e_1_3_3_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3549370"},{"key":"e_1_3_3_76_2","doi-asserted-by":"publisher","unstructured":"Zhihao Xu Shikai Guo Guilin Zhao Peiyu Zou Xiaochen Li and He Jiang. 2024. A novel HDL code generator for effectively testing FPGA logic synthesis compilers. CoRR abs\/2407.12037 (2024). DOI:10.48550\/ARXIV.2407.12037","DOI":"10.48550\/ARXIV.2407.12037"},{"key":"e_1_3_3_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993532"},{"key":"e_1_3_3_78_2","unstructured":"YosysHQ. 2019. VlogHammer. (2019). Retrieved January 30 2025 from https:\/\/github.com\/YosysHQ\/VlogHammer"},{"key":"e_1_3_3_79_2","unstructured":"zachjs. 2024. sv2v. (2024). Retrieved January 30 2025 from https:\/\/github.com\/zachjs\/sv2v"},{"key":"e_1_3_3_80_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523455"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715325","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3715325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:18Z","timestamp":1750295898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3715325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,7]]},"references-count":79,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3,31]]}},"alternative-id":["10.1145\/3715325"],"URL":"https:\/\/doi.org\/10.1145\/3715325","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,7]]},"assertion":[{"value":"2024-07-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}