{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:13:11Z","timestamp":1740287591674,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642139765"},{"type":"electronic","value":"9783642139772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13977-2_10","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T11:35:48Z","timestamp":1277811348000},"page":"101-116","source":"Crossref","is-referenced-by-count":1,"title":["Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding"],"prefix":"10.1007","author":[{"given":"Eugene","family":"Goldberg","sequence":"first","affiliation":[]},{"given":"Panagiotis","family":"Manolios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544389","volume-title":"Digital Systems Testing and Testable Design","author":"M. Abramovici","year":"1994","unstructured":"Abramovici, M., Breuer, M., Friedman, D.: Digital Systems Testing and Testable Design. John Wiley & Sons, Chichester (1994)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/B978-044450813-3\/50004-7","volume-title":"Handbook of Automated Reasoning","author":"L. Bachmair","year":"2001","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, ch.2, pp. 19\u201399. North-Holland, Amsterdam (2001)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Budd, T.A., DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Theoretical and empirical studies on using program mutation to test the functional correctness of programs. In: 7th ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages, Las Vegas, Nevada, pp. 220\u2013233 (1980)","DOI":"10.1145\/567446.567468"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-73770-4_10","volume-title":"Tests and Proofs","author":"C. Engel","year":"2007","unstructured":"Engel, C., H\u00e4hnle, R.: Generating unit tests from formal proofs. In: Gurevich, Y., Meyer, B. (eds.) TAP 2007. LNCS, vol.\u00a04454, pp. 169\u2013188. Springer, Heidelberg (2007)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-02777-2_16","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"E. Goldberg","year":"2009","unstructured":"Goldberg, E.: Boundary points and resolution. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 147\u2013160. Springer, Heidelberg (2009)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-78163-9_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"E. Goldberg","year":"2008","unstructured":"Goldberg, E.: On bridging simulation and formal verification. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 127\u2013141. Springer, Heidelberg (2008)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Sakallah, K.: Grasp - a new search algorithm for satisfiability. In: International conference on computer-aided design, Washington, DC, USA, pp. 220\u2013227 (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-73770-4_6","volume-title":"Tests and Proofs","author":"M. Satpathy","year":"2007","unstructured":"Satpathy, M., Butler, M.J., Leuschel, M., Ramesh, S.: Automatic testing from formal specifications. In: Gurevich, Y., Meyer, B. (eds.) TAP 2007. LNCS, vol.\u00a04454, pp. 95\u2013113. Springer, Heidelberg (2007)"},{"key":"10_CR9","unstructured":"Tseitin, G.S.: On the complexity of derivation in the propositional calculus. In: Zapiski nauchnykh seminarov LOMI, vol.\u00a08, pp. 234\u2013259 (1968)"},{"key":"10_CR10","unstructured":"Alloy system, http:\/\/alloy.mit.edu\/community"},{"key":"10_CR11","unstructured":"CProver, http:\/\/www.cprover.org\/cbmc"},{"key":"10_CR12","unstructured":"JavaPathfinder, http:\/\/babelfish.arc.nasa.gov\/trac\/jpf"},{"key":"10_CR13","unstructured":"SAT 2009 competition, http:\/\/www.satcompetition.org\/2009"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13977-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T09:26:25Z","timestamp":1740216385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13977-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139765","9783642139772"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13977-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}