{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:02:20Z","timestamp":1754161340452,"version":"3.41.2"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"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":[[2020,3]]},"DOI":"10.1109\/isqed48828.2020.9137052","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T16:46:45Z","timestamp":1594313205000},"page":"155-160","source":"Crossref","is-referenced-by-count":6,"title":["SATConda: SAT to SAT-Hard Clause Translator"],"prefix":"10.1109","author":[{"given":"Rakibul","family":"Hassan","sequence":"first","affiliation":[{"name":"George Mason University,Fairfax,VA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Kolhe","sequence":"additional","affiliation":[{"name":"George Mason University,Fairfax,VA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Setareh","family":"Rafatirad","sequence":"additional","affiliation":[{"name":"George Mason University,Fairfax,VA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houman","family":"Homayoun","sequence":"additional","affiliation":[{"name":"George Mason University,Fairfax,VA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sai Manoj","family":"Dinakarrao","sequence":"additional","affiliation":[{"name":"George Mason University,Fairfax,VA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2015.7140252"},{"journal-title":"Handbook of Satisfiability Frontiers in Artificial Intelligence and Applications","year":"2009","author":"franco","key":"ref11"},{"key":"ref12","article-title":"Mitigating sat attack on logic locking","author":"xie","year":"0","journal-title":"Conference of Cryptographic Hardware and Embedded Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2017.7858346"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3299874.3319496"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-019-05800-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.284"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060469"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060458"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203759"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2019.00088"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2335155"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317762"},{"key":"ref5","first-page":"102","article-title":"Rnn-based classifier to detect stealthy malware using localized features and complex symbolic sequence","volume":"90","author":"shukla","year":"0","journal-title":"Image"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2511144"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.7873\/DATE.2013.261"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.299"},{"key":"ref1","article-title":"Trusted defense microelectronics: future access and capabilities are uncertain","author":"mak","year":"2015","journal-title":"Government Accountability Office Washington DC"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2016.7495588"},{"key":"ref20","article-title":"Neural message passing for quantum chemistry","author":"gilmer","year":"0","journal-title":"Int Conf on Machine Learning"},{"key":"ref22","article-title":"Learning a SAT solver from single-bit supervision","author":"selsam","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref21","first-page":"1","article-title":"Minisat vl. 13-a sat solver with conflict-clause minimization","volume":"2005","author":"sorensson","year":"2005","journal-title":"SAT"},{"key":"ref24","article-title":"GLUCOSE: a solver that predicts learnt clauses quality","author":"audemard","year":"2009","journal-title":"Sat competition"},{"journal-title":"Lingeling plingeling and treengeling entering the sat competition 2013","year":"2013","author":"biere","key":"ref23"}],"event":{"name":"2020 21st International Symposium on Quality Electronic Design (ISQED)","start":{"date-parts":[[2020,3,25]]},"location":"Santa Clara, CA, USA","end":{"date-parts":[[2020,3,26]]}},"container-title":["2020 21st International Symposium on Quality Electronic Design (ISQED)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9131689\/9136966\/09137052.pdf?arnumber=9137052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T19:45:30Z","timestamp":1753731930000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9137052\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isqed48828.2020.9137052","relation":{},"subject":[],"published":{"date-parts":[[2020,3]]}}}