{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T00:35:15Z","timestamp":1762043715965,"version":"build-2065373602"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"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":[[2021,7,6]]},"DOI":"10.1109\/icccnt51525.2021.9579930","type":"proceedings-article","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T19:29:48Z","timestamp":1635967788000},"page":"1-5","source":"Crossref","is-referenced-by-count":3,"title":["Test Set Generation for Multiple Faults in Boolean Systems using SAT Solver"],"prefix":"10.1109","author":[{"given":"P Partha","family":"Koundinya","sequence":"first","affiliation":[]},{"given":"Sai Krishna","family":"Reddy Y","sequence":"additional","affiliation":[]},{"given":"V Mani","family":"Deepak","sequence":"additional","affiliation":[]},{"given":"K","family":"Rutwesh","sequence":"additional","affiliation":[]},{"given":"Anuj","family":"Deshpande","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/AITC.2019.8920898"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2003.1214348"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCSET49122.2020.235507"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0817-5_12"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-018-5747-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref28","article-title":"Minisat 2.2 and minisat++ 1.1","volume":"2010","author":"sorensson","year":"2010","journal-title":"A short description in SAT Race"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2019.02.013"},{"key":"ref27","first-page":"31","article-title":"Minisat 2.1 and minisat++ 1.0-sat race 2008 editions","author":"s\u00f6rensson","year":"2009","journal-title":"SAT"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-017-1522-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2396646"},{"key":"ref29","first-page":"71","article-title":"Automatic Test Pattern Generation of Multiple stuck-at faults using Test Patterns of Single stuck-at faults","author":"reddy","year":"0","journal-title":"2021 5th International Conference on Trends in Electronics and Informatics (ICOEI)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/GENSiPS.2011.6169450"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7548-5"},{"key":"ref7","first-page":"555","article-title":"The complexity of fault detection problems for combinational logic circuits","volume":"31","author":"fujiwara","year":"1982","journal-title":"IEEE Computer Architecture Letters"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218339012400062"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9976-4"},{"key":"ref1","volume":"2","author":"abramovici","year":"1990","journal-title":"Digital Systems Testing and Testable Design"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"ref22","first-page":"502","article-title":"An extensible SAT-solver","author":"e\u00e9n","year":"0","journal-title":"International Conference on Theory and Applications of Satisfiability Testing"},{"key":"ref21","first-page":"313","article-title":"The quest for efficient Boolean satisfiability solvers","author":"zhang","year":"2002","journal-title":"Automated Deduction-CADE-18"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.10.007"},{"key":"ref26","first-page":"1","article-title":"Minisat v1.13 - A SAT Solver with Conflict-Clause Minimization","volume":"2005","author":"s\u00f6rensson","year":"2005","journal-title":"SAT"},{"key":"ref25","article-title":"Minisat v2. 0 (beta)","volume":"2006","author":"een","year":"2006","journal-title":"Solver Description SAT Race"}],"event":{"name":"2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)","start":{"date-parts":[[2021,7,6]]},"location":"Kharagpur, India","end":{"date-parts":[[2021,7,8]]}},"container-title":["2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9579467\/9579470\/09579930.pdf?arnumber=9579930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:57Z","timestamp":1652201757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9579930\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icccnt51525.2021.9579930","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]}}}