{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:30:25Z","timestamp":1763724625087,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"the Natural Science Foundation Project of the Xinjiang Autonomous Region under Grant","award":["2019D01A27"],"award-info":[{"award-number":["2019D01A27"]}]},{"name":"the school-level scientific research fund project of Xinjiang University of Finance and Economics under Grant 2","award":["2019XYB005"],"award-info":[{"award-number":["2019XYB005"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3221764","type":"journal-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T21:42:06Z","timestamp":1668462126000},"page":"120369-120382","source":"Crossref","is-referenced-by-count":4,"title":["A Heuristic Boolean NPN Equivalent Matching Verification Method Based on Shannon Decomposition"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4968-3896","authenticated-orcid":false,"given":"Juling","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Cyberspace Security, Xinjiang University of Finance and Economics, Urumqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqiang","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Cyberspace Security, Xinjiang University of Finance and Economics, Urumqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-0320","authenticated-orcid":false,"given":"Guowu","family":"Yang","sequence":"additional","affiliation":[{"name":"Big Data Research Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0888-8222","authenticated-orcid":false,"given":"Yixin","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Cyberspace Security, Xinjiang University of Finance and Economics, Urumqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyi","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Software, Xinjiang University, Urumqi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855951"},{"key":"ref31","first-page":"841","article-title":"A unified approach to canonical form-based Boolean matching","author":"agosta","year":"2007","journal-title":"Proc 44th ACM\/IEEE Design Autom Conf"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2018.8297387"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923256"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2778338"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.12.3443"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2016547"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SCM.2017.7970644"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SCM.2016.7519785"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2971466"},{"key":"ref17","first-page":"642","article-title":"Signature based Boolean matching in the presence of don’t cares","author":"abdollahi","year":"2008","journal-title":"Proc 45th Annu Conf Design Autom (DAC)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/sym11010027"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643587"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SBCCI.2003.1232803"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2974015"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654215"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3079310"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2018.00008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457266"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-018-9903-0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2949310"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2016.7577306"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2966986.2980072"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2013.6718374"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-1787-x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2017.8050970"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICVES.2013.6619648"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630016"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E93.A.1775"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.1374"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837398"},{"key":"ref25","first-page":"234","article-title":"Incremental learning approach and SAT model for Boolean matching with don’t cares","author":"wang","year":"2007","journal-title":"Proc IEEE\/ACM Int Conf Comput -Aided Design"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09947021.pdf?arnumber=9947021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:59:56Z","timestamp":1670875196000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9947021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3221764","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}