{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T21:09:58Z","timestamp":1769202598935,"version":"3.49.0"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000028","name":"Semiconductor Research Corporation (SRC)","doi-asserted-by":"publisher","award":["1875.001"],"award-info":[{"award-number":["1875.001"]}],"id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation Grant \u201cEnhanced equivalence checking in crypto-analytic applications.\u201d"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/tcad.2015.2481860","type":"journal-article","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T14:47:32Z","timestamp":1443106052000},"page":"919-930","source":"Crossref","is-referenced-by-count":1,"title":["<inline-formula> <tex-math notation=\"LaTeX\">${m}$ <\/tex-math> <\/inline-formula>-Inductive Property of Sequential Circuits"],"prefix":"10.1109","volume":"35","author":[{"given":"Hamid","family":"Savoj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Mishchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Brayton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2008.ECP.8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2005.193853"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2009.5090932"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2006.320087"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681580"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.264"},{"key":"ref16","first-page":"414","article-title":"Node mergers in the presence of don’t cares","author":"plaza","year":"2007","journal-title":"Proc Asia South Pacific Des Autom Conf (ASP-DAC)"},{"key":"ref17","first-page":"277","article-title":"Multi-level logic simplification using don’t cares and filters","author":"saldanha","year":"1989","journal-title":"Proc 26th Design Automat Conf (DAC)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2284190"},{"key":"ref19","article-title":"Don’t cares in multi-level network optimization","author":"savoj","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_5"},{"key":"ref3","first-page":"409","article-title":"SAT-based verification without state space traversal","author":"bjesse","year":"2002","journal-title":"Formal Methods in Computer-Aided Design"},{"key":"ref6","first-page":"2","article-title":"Perturb and simplify: Multi-level Boolean network optimizer","author":"chang","year":"1994","journal-title":"Proc Int Conf Comput -Aided Design"},{"key":"ref5","first-page":"199","article-title":"Network hierarchies and node minimization","volume":"78 d","author":"brayton","year":"1995","journal-title":"IEICE Trans Inf Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/EDTC.1996.494131"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1996.545619"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/43.3211"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1992.527904"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/ICCAD.1997.643522","article-title":"Sequential optimization without state space exploration","author":"mehrotra","year":"1997","journal-title":"Proc IEEE\\ACM Int Conf Comput -Aided Design (ICCAD)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1990.114954"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.1998.655922"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58179-0_64"},{"key":"ref23","first-page":"229","article-title":"SAT sweeping with local observability don’t-cares","author":"zhu","year":"2006","journal-title":"Proc ACM\/IEEE Design Autom Conf (DAC)"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/7471560\/07275145.pdf?arnumber=7275145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:05Z","timestamp":1641987965000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7275145\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":23,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2015.2481860","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}