{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:05:14Z","timestamp":1725865514030},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319465197"},{"type":"electronic","value":"9783319465203"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46520-3_1","type":"book-chapter","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T10:40:27Z","timestamp":1474454427000},"page":"3-10","source":"Crossref","is-referenced-by-count":0,"title":["Synthesizing and Completely Testing Hardware Based on Templates Through Small Numbers of Test Patterns"],"prefix":"10.1007","author":[{"given":"Masahiro","family":"Fujita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Mangassarian, H., Yoshida, H., Veneris, A.G., Yamashita, S., Fujita, M.: On error tolerance and engineering change with partially programmable circuits. In: The 17th Asia and South Pacific Design Automation Conference (ASP-DAC 2012), pp. 695\u2013700 (2012)","DOI":"10.1109\/ASPDAC.2012.6165045"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Jo, S., Matsumoto, T., Fujita, M.: SAT-based automatic rectification and debugging of combinational circuits with LUT insertions. In: Asian Test Symposium (ATS), pp. 19\u201324, November 2012","DOI":"10.1109\/ATS.2012.55"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Fujita, M., Jo, S., Ono, S., Matsumoto, T.: Partial synthesis through sampling with and without specification. In: International Conference on Computer Aided Design (ICCAD), pp. 787\u2013794, November 2013","DOI":"10.1109\/ICCAD.2013.6691203"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-31612-8_10","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"M Janota","year":"2012","unstructured":"Janota, M., Klieber, W., Marques-Silva, J., Clarke, E.: Solving QBF with counterexample guided refinement. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 114\u2013128. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31612-8_10"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","volume-title":"Computer Aided Verification","author":"R Brayton","year":"2010","unstructured":"Brayton, R., Mishchenko, A.: ABC: an academic industrial-strength verification tool. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 24\u201340. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14295-6_5"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11499107_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"A Ling","year":"2005","unstructured":"Ling, A., Singh, D.P., Brown, S.D.: FPGA logic synthesis using quantified boolean satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 444\u2013450. Springer, Heidelberg (2005). doi: 10.1007\/11499107_37"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S.A., Saraswat, V.A.: Combinatorial sketching for finite programs. In: ASPLOS 2006, pp. 404\u2013415 (2006)","DOI":"10.1145\/1168857.1168907"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Jain, J., Mukherjee, R., Fujita, M.: Advanced verification techniques based on learning. In: The 32nd Annual ACM\/IEEE Design Automation Conference, pp. 420\u2013426 (1995)","DOI":"10.1145\/217474.217564"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-21581-0_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"M Janota","year":"2011","unstructured":"Janota, M., Marques-Silva, J.: Abstraction-based algorithm for 2QBF. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 230\u2013244. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21581-0_19"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46520-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:19:48Z","timestamp":1498346388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46520-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319465197","9783319465203"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46520-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}