{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:45:19Z","timestamp":1648683919521},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4258,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1016\/s1571-0661(04)80665-0","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"11-22","source":"Crossref","is-referenced-by-count":2,"title":["Evaluating Semi-Exhaustive Verification Techniques for Bug Hunting"],"prefix":"10.1016","volume":"23","author":[{"given":"Ranan","family":"Fraer","sequence":"first","affiliation":[]},{"given":"Gila","family":"Kamhi","sequence":"additional","affiliation":[]},{"given":"Limor","family":"Fix","sequence":"additional","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB1","doi-asserted-by":"crossref","unstructured":"K. Ravi, F. Somenzi. High Density Reachability Analysis. In Proceedings of International Conference on Computer-Aided Design, Santa Clara, CA, November 1995.","DOI":"10.1109\/ICCAD.1995.480006"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB2","unstructured":"M. Ganai, A Aziz. Efficient Coverage Directed State Space Search. In Proceedings of IWLS'98."},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB3","doi-asserted-by":"crossref","unstructured":"J. Yuan, J. Shen, J. Abraham, and A. Aziz. On Combining Formal and Informal Verification. In Proceedings of the Computer Aided Verification Conf., July 1997.","DOI":"10.1007\/3-540-63166-6_37"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB4","doi-asserted-by":"crossref","unstructured":"C. Yang, D. Dill. Validation with Guided Search of the State Space. In Proceedings of DAC'98.","DOI":"10.1145\/277044.277201"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB5","unstructured":"A. Aziz J. Kukula, T. Shiple. Hybrid Verification Using Saturated Simulation. In Proceedings of DAC'98."},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB6","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based Algorithms for Boolean Function Manipulations","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB7","series-title":"Symbolic Model Checking","author":"McMillan","year":"1993"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB8","doi-asserted-by":"crossref","unstructured":"T.R. Shiple. Formal Analysis of Synchronous Circuits PhD thesis, University of California at Berkeley, 1996.","DOI":"10.1109\/EDTC.1996.494321"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB9","doi-asserted-by":"crossref","unstructured":"K. Ravi, K.L. McMillan, T.R. Shiple, F. Somenzi. Approximation and Decomposition of Binary Decision Diagrams. In Proceedings of DAC'98.","DOI":"10.1145\/277044.277168"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB10","doi-asserted-by":"crossref","unstructured":"O. Coudert, J. Madre. A Unified Framework for the Formal Verification of Sequential Circuits. In Proceedings of ICCAD'90.","DOI":"10.1109\/ICCAD.1990.129859"},{"key":"10.1016\/S1571-0661(04)80665-0_NEWBIB11","doi-asserted-by":"crossref","unstructured":"B. Lin, R. Newton. Implicit Manipulation of Equivalence Classes Using Binary Decision Diagrams. In Proceedings of ICCD'91.","DOI":"10.1109\/ICCD.1991.139995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806650?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806650?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T06:20:03Z","timestamp":1549174803000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S1571066104806650"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80665-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}