{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:14:29Z","timestamp":1648757669460},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0141-9331(92)90069-6","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T01:33:26Z","timestamp":1047692006000},"page":"269-275","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on population coverage using test generation by fault sampling"],"prefix":"10.1016","volume":"16","author":[{"given":"Hassan","family":"Farhat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"From","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0141-9331(92)90069-6_BIB1_1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TC.1981.1675757","article-title":"An implicit enumeration algorithm to generate tests for combinational logic circuits","volume":"Vol C-30","author":"Goel","year":"1981","journal-title":"IEEE Trans. Comp."},{"key":"10.1016\/0141-9331(92)90069-6_BIB1_2","series-title":"Fault-Tolerant Comp. Symp. (FTCS-10) Digest of Papers","first-page":"145","article-title":"An implicit enumeration algorithm to generate tests for combinational logic circuits","volume":"Vol C-30","author":"Goel","year":"1980"},{"issue":"No 1","key":"10.1016\/0141-9331(92)90069-6_BIB2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/43.3140","article-title":"SOCRATES: A highly efficient automatic test pattern generation system","volume":"Vol 7","author":"Schulz","year":"1988","journal-title":"IEEE Trans. Comp-Aided Des."},{"key":"10.1016\/0141-9331(92)90069-6_BIB3","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/T-C.1972.223542","article-title":"A deductive method for simulating faults in logic circuits","volume":"Vol C-21","author":"Armstrong","year":"1972","journal-title":"IEEE Trans. Comp."},{"issue":"No 4","key":"10.1016\/0141-9331(92)90069-6_BIB4","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/12.54854","article-title":"A statistical theory of digital circuit testability","volume":"Vol 39","author":"Seth","year":"1990","journal-title":"IEEE Trans. Comp."},{"key":"10.1016\/0141-9331(92)90069-6_BIB5","series-title":"Fault-Tolerant Comp. Symp. (FTCS-17) Digest of Papers","first-page":"28","article-title":"Is there hope for linear time fault simulation?","author":"Harel","year":"1987"},{"key":"10.1016\/0141-9331(92)90069-6_BIB6","series-title":"Proc. Int. Conf. Comput. Design (ICCD-88)","first-page":"58","article-title":"Test generation by fault sampling","author":"Agrawal","year":"1988"},{"key":"10.1016\/0141-9331(92)90069-6_BIB7","series-title":"Proc. Int. Symp. Circ. and Syst.","first-page":"221","article-title":"On testability analysis of combinational networks","author":"Brglez","year":"1984"},{"key":"10.1016\/0141-9331(92)90069-6_BIB8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MDT.1985.294683","article-title":"Statistical fault analysis","volume":"Vol 2","author":"Jain","year":"1985","journal-title":"IEEE Des. Test Comp."},{"key":"10.1016\/0141-9331(92)90069-6_BIB9","series-title":"Fault-Tolerant Comp. Symp. (FTCS-15) Digest of Papers","first-page":"220","article-title":"PREDICT-Probabilistic estimation of digital circuit testability","author":"Seth","year":"1985"},{"key":"10.1016\/0141-9331(92)90069-6_BIB10","series-title":"Probability, Random Variables, and Stochastic Processes","author":"Papoulis","year":"1965"},{"key":"10.1016\/0141-9331(92)90069-6_BIB11","series-title":"Approximation Theorems in Mathematical Statistics","author":"Serfling","year":"1980"},{"key":"10.1016\/0141-9331(92)90069-6_BIB12","series-title":"Proc. Int. Symp. on Circuits and Systems; Special Session on ATPG and Fault Simulation","first-page":"663","article-title":"A neutral netlist of 10 combinational benchmark circuits and a target translator in Fortran","author":"Brglez","year":"1985"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0141933192900696?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0141933192900696?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T04:26:49Z","timestamp":1553488009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0141933192900696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0141933192900696"],"URL":"https:\/\/doi.org\/10.1016\/0141-9331(92)90069-6","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}