{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:56:56Z","timestamp":1782867416412,"version":"3.54.5"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227485","type":"print"},{"value":"9783032227492","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22749-2_16","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:09:18Z","timestamp":1776258558000},"page":"309-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ReVEAL: GNN-Guided Reverse Engineering for Formal Verification of Optimized Multipliers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8825-6260","authenticated-orcid":false,"given":"Chen","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5645-0292","authenticated-orcid":false,"given":"Daniela","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6482-5855","authenticated-orcid":false,"given":"Chenhui","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8357-2102","authenticated-orcid":false,"given":"Zhan","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4001-264X","authenticated-orcid":false,"given":"Hongce","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3481-307X","authenticated-orcid":false,"given":"Cunxi","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,15]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Sano, S., Yanase, T., Ohta, T., Koyama, M.: Optuna: A next-generation hyperparameter optimization framework. In: The 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. pp. 2623\u20132631 (2019)","DOI":"10.1145\/3292500.3330701"},{"key":"16_CR2","unstructured":"Alon, U., Yahav, E.: On the bottleneck of graph neural networks and its practical implications. In: 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021. OpenReview.net (2021), https:\/\/openreview.net\/forum?id=i80OPhOCVH2"},{"key":"16_CR3","unstructured":"Biere, A., Fazekas, K., Fleury, M., Froleyks, N.: Clausal congruence closure. In: 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"16_CR4","unstructured":"Biere, A., Fazekas, K., Fleury, M., Froleyks, N.: Clausal equivalence sweeping. In: FMCAD 2024. pp. 236\u2013241. TU Wien Academic Press (2024)"},{"key":"16_CR5","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck (1965)"},{"key":"16_CR6","unstructured":"Chatterjee, S.: On algorithms for technology mapping. University of California, Berkeley (2007)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ciesielski, M., Su, T., Yasin, A., Yu, C.: Understanding algebraic rewriting for arithmetic circuit verification: a bit-flow model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39(6), 1346\u20131357 (2019)","DOI":"10.1109\/TCAD.2019.2912944"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ciesielski, M., Yu, C., Brown, W., Liu, D., Rossi, A.: Verification of gate-level arithmetic circuits by function extraction. In: Proceedings of the 52nd Annual Design Automation Conference. pp.\u00a01\u20136 (2015)","DOI":"10.1145\/2744769.2744925"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Deng, C., Yue, Z., Yu, C., Sarar, G., Carey, R., Jain, R., Zhang, Z.: Less is more: Hop-wise graph attention for scalable and generalizable learning on circuits. In: Proceedings of the 61st ACM\/IEEE Design Automation Conference. pp.\u00a01\u20136 (2024)","DOI":"10.1145\/3649329.3657386"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Hamilton, W.L.: Graph representation learning. Morgan & Claypool Publishers (2020)","DOI":"10.1007\/978-3-031-01588-5"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"He, Z., Wang, Z., Bai, C., Yang, H., Yu, B.: Graph learning-based arithmetic block identification. In: 2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD). pp.\u00a01\u20138. IEEE (2021)","DOI":"10.1109\/ICCAD51958.2021.9643581"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Homma, N., Watanabe, Y., Aoki, T., Higuchi, T.: Formal Design of Arithmetic Circuits Based on Arithmetic Description Language. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(12), 3500\u20133509 (2006). https:\/\/doi.org\/10.1093\/IETFEC\/E89-A.12.3500","DOI":"10.1093\/IETFEC\/E89-A.12.3500"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Kaufmann, D., Biere, A.: Amulet 2.0 for verifying multiplier circuits. In: TACAS (2). LNCS, vol. 12652, pp. 357\u2013364. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_19","DOI":"10.1007\/978-3-030-72013-1_19"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Kaufmann, D., Biere, A.: Improving amulet2 for verifying multiplier circuits using sat solving and computer algebra. International Journal on Software Tools for Technology Transfer 25(2), 133\u2013144 (2023)","DOI":"10.1007\/s10009-022-00688-6"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Kaufmann, D., Fleury, M., Biere, A., Kauers, M.: Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Past\u00e8que and Nuss-Checker. Formal Methods in System Design (2022). https:\/\/doi.org\/10.1007\/s10703-022-00391-x","DOI":"10.1007\/s10703-022-00391-x"},{"key":"16_CR16","unstructured":"Knyazev, B., Taylor, G.W., Amer, M.R.: Understanding attention and generalization in graph neural networks. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada. pp. 4204\u20134214 (2019), https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/4c5bcfec8584af0d967f1ab10179ca4b-Abstract.html"},{"key":"16_CR17","unstructured":"Konrad, A., Scholl, C.: Symbolic computer algebra for multipliers revisited-it\u2019s all about orders and phases. In: FMCAD 2024. pp. 261\u2013271. TU Wien Academic Press (2024)"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Li, Q., Han, Z., Wu, X.: Deeper insights into graph convolutional networks for semi-supervised learning. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018. pp. 3538\u20133545. AAAI Press (2018). https:\/\/doi.org\/10.1609\/AAAI.V32I1.11604, https:\/\/doi.org\/10.1609\/aaai.v32i1.11604","DOI":"10.1609\/AAAI.V32I1.11604"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Li, R., Li, L., Yu, H., Fujita, M., Jiang, W., Ha, Y.: Refscat: Formal verification of logic-optimized multipliers via automated reference multiplier generation and sca-sat synergy. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2024)","DOI":"10.1109\/TCAD.2024.3442987"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Mahzoon, A., Gro\u00dfe, D., Drechsler, R.: 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 (2021), https:\/\/api.semanticscholar.org\/CorpusID:235831211","DOI":"10.1007\/978-3-030-68071-8_9"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Mahzoon, A., Gro\u00dfe, D., Drechsler, R.: Revsca-2.0: Sca-based formal verification of nontrivial multipliers using reverse engineering and local vanishing removal. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 41(5), 1573\u20131586 (2021)","DOI":"10.1109\/TCAD.2021.3083682"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Mishchenko, A., Chatterjee, S., Brayton, R.K.: Dag-aware AIG rewriting a fresh look at combinational logic synthesis. In: Sentovich, E. (ed.) Proceedings of the 43rd Design Automation Conference, DAC 2006, San Francisco, CA, USA, July 24-28, 2006. pp. 532\u2013535. ACM (2006). https:\/\/doi.org\/10.1145\/1146909.1147048, https:\/\/doi.org\/10.1145\/1146909.1147048","DOI":"10.1145\/1146909.1147048"},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Pan, P., Lin, C.: A new retiming-based technology mapping algorithm for lut-based fpgas. In: Cong, J., Kaptanoglu, S. (eds.) Proceedings of the 1998 ACM\/SIGDA Sixth International Symposium on Field Programmable Gate Arrays, FPGA 1998, Monterey, CA, USA, February 22-24, 1998. pp. 35\u201342. ACM (1998). https:\/\/doi.org\/10.1145\/275107.275118, https:\/\/doi.org\/10.1145\/275107.275118","DOI":"10.1145\/275107.275118"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Shi, Y., Huang, Z., Feng, S., Zhong, H., Wang, W., Sun, Y.: Masked label prediction: Unified message passing model for semi-supervised classification. In: Zhou, Z. (ed.) Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event \/ Montreal, Canada, 19-27 August 2021. pp. 1548\u20131554. ijcai.org (2021). https:\/\/doi.org\/10.24963\/IJCAI.2021\/214, https:\/\/doi.org\/10.24963\/ijcai.2021\/214","DOI":"10.24963\/IJCAI.2021\/214"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Shi, Z., Zheng, Z., Khan, S., Zhong, J., Li, M., Xu, Q.: Deepgate3: towards scalable circuit representation learning. arXiv preprint arXiv:2407.11095 (2024)","DOI":"10.1145\/3676536.3676791"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Tan, Y.K., Heule, M.J.H., Myreen, M.O.: Verified propagation redundancy and compositional UNSAT checking in cakeml. Int. J. Softw. Tools Technol. Transf. 25(2), 167\u2013184 (2023)","DOI":"10.1007\/s10009-022-00690-y"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Temel, M., Slobodov\u00e1, A., Hunt, W.A.: Automated and scalable verification of integer multipliers. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12224, pp. 485\u2013507. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_23, https:\/\/doi.org\/10.1007\/978-3-030-53288-8_23","DOI":"10.1007\/978-3-030-53288-8_23"},{"key":"16_CR28","doi-asserted-by":"publisher","unstructured":"Ustun, E., Deng, C., Pal, D., Li, Z., Zhang, Z.: Accurate operation delay prediction for FPGA HLS using graph neural networks. In: IEEE\/ACM International Conference On Computer Aided Design, ICCAD 2020, San Diego, CA, USA, November 2-5, 2020. pp. 87:1\u201387:9. IEEE (2020). https:\/\/doi.org\/10.1145\/3400302.3415657, https:\/\/doi.org\/10.1145\/3400302.3415657","DOI":"10.1145\/3400302.3415657"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Wang, Z., Bai, C., He, Z., Zhang, G., Xu, Q., Ho, T.Y., Huang, Y., Yu, B.: Fgnn2: A powerful pre-training framework for learning the logic functionality of circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2024)","DOI":"10.1109\/TCAD.2024.3434464"},{"key":"16_CR30","unstructured":"Wolf, C.: Yosys open synthesis suite. https:\/\/yosyshq.net\/yosys\/"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Wu, N., Li, Y., Hao, C., Dai, S., Yu, C., Xie, Y.: Gamora: Graph learning based symbolic reasoning for large-scale boolean networks. In: 2023 60th ACM\/IEEE Design Automation Conference (DAC). pp.\u00a01\u20136. IEEE (2023)","DOI":"10.1109\/DAC56929.2023.10247828"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Yu, C., Brown, W., Liu, D., Rossi, A., Ciesielski, M.: Formal verification of arithmetic circuits by function extraction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 35(12), 2131\u20132142 (2016)","DOI":"10.1109\/TCAD.2016.2547898"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Yu, C., Ciesielski, M., Mishchenko, A.: Fast algebraic rewriting based on and-inverter graphs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 37(9), 1907\u20131911 (2017)","DOI":"10.1109\/TCAD.2017.2772854"},{"key":"16_CR34","doi-asserted-by":"publisher","unstructured":"Yu, C., Ciesielski, M.J.: Automatic word-level abstraction of datapath. In: IEEE International Symposium on Circuits and Systems, ISCAS 2016, Montr\u00e9al, QC, Canada, May 22-25, 2016. pp. 1718\u20131721. IEEE (2016). https:\/\/doi.org\/10.1109\/ISCAS.2016.7538899, https:\/\/doi.org\/10.1109\/ISCAS.2016.7538899","DOI":"10.1109\/ISCAS.2016.7538899"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, H., Jiang, J.R., Amar\u00f9, L.G., Mishchenko, A., Brayton, R.K.: Deep integration of circuit simulator and SAT solver. In: 58th ACM\/IEEE Design Automation Conference, DAC 2021, San Francisco, CA, USA, December 5-9, 2021. pp. 877\u2013882. IEEE (2021)","DOI":"10.1109\/DAC18074.2021.9586331"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22749-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:20:58Z","timestamp":1782865258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22749-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227485","9783032227492"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22749-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"15 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The source code that supports the contributions of this work is freely available at\n                      \n                      . The complete dataset and reproducible models are available at\n                      \n                      . The authors confirm that the data supporting the findings of this study are available within the paper and the artifact.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code and Data Availability Statement"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}