{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:43:23Z","timestamp":1729640603041,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/hldvt.2011.6113981","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T14:31:55Z","timestamp":1325860315000},"page":"84-91","source":"Crossref","is-referenced-by-count":16,"title":["SAT-based techniques for determining backbones for post-silicon fault localisation"],"prefix":"10.1109","author":[{"given":"Charlie Shucheng","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Weissenbacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divjyot","family":"Sethi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharad","family":"Malik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","article-title":"Determining computational complexity from characteristic 'phase transitions'","volume":"400","author":"monasson","year":"1999","journal-title":"Nature"},{"key":"17","first-page":"15","article-title":"On computing backbones of propositional theories","author":"marques-silva","year":"2010","journal-title":"European Conference on Artificial Intelligence (ECAI)"},{"key":"18","first-page":"250","article-title":"Applying SAT methods in unbounded symbolic model checking","volume":"2404","author":"mcmillan","year":"2002","journal-title":"LNCS"},{"key":"33","article-title":"Post-silicon fault localisation using maximum satisfiability and backbones","author":"zhu","year":"2011","journal-title":"Formal Methods in Computer-Aided Design (FMCAD)"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2008.4484858"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/43.310903"},{"key":"13","first-page":"1368","article-title":"Backbones and backdoors in satisfiability","volume":"3","author":"kilby","year":"2005","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"14","first-page":"175","article-title":"The backbone of the travelling salesperson","author":"kilby","year":"2005","journal-title":"International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"11","first-page":"96","article-title":"Detecting inadmissible and necessary variables in large propositional formulae","author":"kaiser","year":"2001","journal-title":"Proceedings of Joint International Conference on Automated Reasoning (IJCAR"},{"key":"12","first-page":"351","article-title":"Balance and filtering in structured satisfiable problems","author":"kautz","year":"2001","journal-title":"International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837367"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2001.156196"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2030595"},{"key":"23","first-page":"31","article-title":"Minimal assignments for bounded model checking","volume":"2988","author":"ravi","year":"2004","journal-title":"LNCS"},{"key":"24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1008725524946","article-title":"A tutorial on Sta?lmarck's proof procedure for propositional logic","volume":"16","author":"sheeran","year":"2000","journal-title":"Formal Methods in System Design (FMSD)"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060403171065"},{"key":"26","first-page":"254","article-title":"Backbones in optimization and approximation","author":"slaney","year":"2001","journal-title":"International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.852031"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"29","first-page":"1173","article-title":"Backdoors to typical case complexity","author":"williams","year":"2003","journal-title":"International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00164-5"},{"key":"2","first-page":"707","article-title":"Searching for backbones and fat: A limit-crossing approach with applications","author":"climer","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10","first-page":"191","article-title":"Do SAT solvers make good configurators?","author":"janota","year":"2008","journal-title":"Software Product Line Conference (SPLC)"},{"key":"1","first-page":"256","article-title":"Generating satisfiable problem instances","author":"achlioptas","year":"2000","journal-title":"National Conference on Artificial Intelligence and Conference on Innovative Applications of Artificial Intelligence"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2010.5450506"},{"key":"7","first-page":"502","article-title":"An extensible SAT-solver","volume":"2919","author":"ee?n","year":"2004","journal-title":"LNCS"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2008.ECP.9"},{"key":"32","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.1389","article-title":"Phase transitions and backbones of the asymmetric traveling salesman problem","volume":"21","author":"zhang","year":"2004","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"31","first-page":"153","article-title":"Phase transitions and backbones of 3-SAT and maximum 3-SAT","volume":"2239","author":"zhang","year":"2001","journal-title":"LNCS"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85958-1_52"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85958-1_53"}],"event":{"name":"2011 IEEE International High Level Design Validation and Test Workshop (HLDVT)","start":{"date-parts":[[2011,11,9]]},"location":"Napa Valley, CA, USA","end":{"date-parts":[[2011,11,11]]}},"container-title":["2011 IEEE International High Level Design Validation and Test Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6093762\/6113979\/06113981.pdf?arnumber=6113981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T01:34:14Z","timestamp":1561167254000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6113981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/hldvt.2011.6113981","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}