{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:29:59Z","timestamp":1763724599975,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1,17]]},"DOI":"10.1109\/asp-dac52403.2022.9712573","type":"proceedings-article","created":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T17:39:17Z","timestamp":1645465157000},"page":"365-370","source":"Crossref","is-referenced-by-count":8,"title":["Accelerate SAT-based ATPG via Preprocessing and New Conflict Management Heuristics"],"prefix":"10.1109","author":[{"given":"Junhua","family":"Huang","sequence":"first","affiliation":[{"name":"Xiamen University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui-Ling","family":"Zhen","sequence":"additional","affiliation":[{"name":"Noah&#x0027;s Ark Lab,Huawei"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naixing","family":"Wang","sequence":"additional","affiliation":[{"name":"Hisilicon,Huawei"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingxuan","family":"Yuan","sequence":"additional","affiliation":[{"name":"Noah&#x0027;s Ark Lab,Huawei"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Mao","sequence":"additional","affiliation":[{"name":"Noah&#x0027;s Ark Lab,Huawei"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Huang","sequence":"additional","affiliation":[{"name":"Hisilicon,Huawei"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiping","family":"Tao","sequence":"additional","affiliation":[{"name":"Xiamen University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DTIS.2014.6850674"},{"key":"ref11","first-page":"83","article-title":"On properties of sat instances produced by sat-based atpgs","author":"balc\u00e1rek","year":"2009","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190089"},{"key":"ref13","first-page":"227","article-title":"Tiguan: Thread-parallel integrated test pattern generator utilizing satisfiability analysis","author":"polian","year":"2009","journal-title":"International Conference on VLSI Design"},{"key":"ref14","first-page":"212","article-title":"Passat: Efficient sat-based test pattern generation for industrial circuits","author":"shi","year":"2005","journal-title":"IEEE Annual Symposium on VLSI"},{"key":"ref15","first-page":"1","article-title":"Passat 2. 0: A multi-functional sac-based testing frame-work","author":"diepenbeck","year":"2013","journal-title":"1 IEEE Latin American Test Workshop - LATW'00"},{"journal-title":"Improved sat-based atpg More constraints better compaction","year":"0","author":"eggersgl\u00fc\u00df","key":"ref16"},{"key":"ref17","first-page":"1","article-title":"Towards complete fault coverage by test point insertion using optimization-sat techniques","author":"eggersgl\u00fc\u00df","year":"2019","journal-title":"IEEE International Test Conference (ITC)"},{"key":"ref18","first-page":"173","article-title":"Formal test point insertion for region-based low-capture-power compact at-speed scan test","author":"holst","year":"2016","journal-title":"IEEE Asian Test Symposium (ATS)"},{"key":"ref19","article-title":"Isasat and kissat entering the eda challenge","author":"fleury","year":"2021","journal-title":"SAT COMPETITION 2021"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1147\/rd.104.0278"},{"key":"ref27","article-title":"kissat, paracooba, plingeling and treengeling entering the sat competition 2020","author":"fleury","year":"2020","journal-title":"SAT COMPETITION 2020"},{"key":"ref3","first-page":"1","article-title":"Hypercompression of test patterns","author":"milewski","year":"2018","journal-title":"IEEE International Test Conference"},{"key":"ref6","first-page":"3","article-title":"High-frequency, at-speed scan testing","volume":"20","author":"rajski","year":"2003","journal-title":"IEEE Design Test of Computers"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675757"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ATS47505.2019.000-6"},{"key":"ref7","first-page":"1016","article-title":"Socrates: A highly efficient automatic test pattern generation system","author":"schulz","year":"1987","journal-title":"International Test Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/VTEST.2003.1197631"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/TCAD.2010.2044673","article-title":"Incremental solving techniques for sat-based atpg","volume":"29","author":"eggersgluss","year":"2010","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1998.743133"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2007.4295272"},{"key":"ref22","first-page":"85","article-title":"A fast untestability proof for sat-based atpg","author":"tille","year":"2009","journal-title":"IEEE\/ACM International Conference on Computer-Aided Design"},{"key":"ref21","first-page":"1","article-title":"Evaluating the effectiveness of d-chains in sat-based atpg","author":"neubauer","year":"2017","journal-title":"IEEE Latin-American Test Symposium"},{"key":"ref24","article-title":"Fraigs: Functionally reduced and-inv graphs","author":"chatterjee","year":"2004","journal-title":"International Conference on Computer Aided Design"},{"key":"ref23","article-title":"Test pattern generation using boolean proof engines","author":"eggersgiu\u00df","year":"2009","journal-title":"Springer Science Business Media"},{"key":"ref26","article-title":"Improved circuit-to-cnf transformation for sat-based atpg","author":"krenz-baath","year":"2008","journal-title":"ETS'08"},{"key":"ref25","first-page":"50","article-title":"Cube and conquer: Guiding cdcl sat solvers by lookaheads","author":"wieringa","year":"2011","journal-title":"Haifa Verification Conference"}],"event":{"name":"2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)","start":{"date-parts":[[2022,1,17]]},"location":"Taipei, Taiwan","end":{"date-parts":[[2022,1,20]]}},"container-title":["2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9712466\/9712479\/09712573.pdf?arnumber=9712573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T17:08:26Z","timestamp":1655140106000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9712573\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/asp-dac52403.2022.9712573","relation":{},"subject":[],"published":{"date-parts":[[2022,1,17]]}}}