{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:37:50Z","timestamp":1694630270607},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[1980,4,1]],"date-time":"1980-04-01T00:00:00Z","timestamp":323395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1980,4]]},"DOI":"10.1109\/tc.1980.1675567","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"288-299","source":"Crossref","is-referenced-by-count":11,"title":["Generic Fault Characterizations for Table Look-Up Coverage Bounding"],"prefix":"10.1109","volume":"C-29","author":[{"family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Masson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","first-page":"732","article-title":"redundancy results in combinational networks by means of l-expressions","author":"agarwal","year":"1977","journal-title":"Proc Fifteenth Annual Allerton Conf Communication Control and Computing"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675612"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675221"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675268"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1972.223428"},{"key":"ref13","author":"diephius","year":"1969","journal-title":"Fault analysis for combinational logic networks"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223139"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1966.264376"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224083"},{"key":"ref17","author":"goldstein","year":"0","journal-title":"A probablistic analysis of multiple faults in LSI circuits"},{"key":"ref18","author":"agarwal","year":"1977","journal-title":"Generic characterizations of multiple faults for table-look-up coverage bounding in tree networks"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90024-8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223124"},{"key":"ref4","first-page":"227","year":"1978","journal-title":"Proceedings of the 1978 Conference on Information Sciences and Systems"},{"key":"ref27","author":"cha","year":"1974","journal-title":"Multiple fault diagnosis in combinational networks"},{"key":"ref3","article-title":"fanout-free boolean functions and l-expressions","author":"agarwal","year":"0","journal-title":"J Ass Comput Mach"},{"key":"ref6","author":"markowsky","year":"77","journal-title":"No single fault test set is smaller than any minimal multiple fault test set for a fanout-free combinational circuit"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/T-C.1973.223617","article-title":"fault detection in fanout-free combinational networks","volume":"c 22","author":"berger","year":"1973","journal-title":"IEEE Transactions on Computers"},{"key":"ref5","author":"markowsky","year":"76","journal-title":"A straightforward technique for producing minimal multiple fault test sets for fanout-free circuits"},{"key":"ref8","first-page":"682","article-title":"simplified multiple stuck-at-fault test generation techniques","author":"latino","year":"1975","journal-title":"Proc 13th Annu Allerton Conf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.5009270"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321988"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223162"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321918"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/sapm194221183","article-title":"the number of two-terminals seriesparallel networks","volume":"xxi","author":"riordan","year":"1942","journal-title":"J Math Phys"},{"key":"ref22","author":"dietmeyer","year":"1971","journal-title":"Logic Design of Digital Systems"},{"key":"ref21","author":"riordan","year":"1958","journal-title":"An Introduction to Combinational Analysis"},{"key":"ref24","first-page":"462","article-title":"a logic design structure for lsi testability","author":"eichelberger","year":"1977","journal-title":"Proc 14th Design Automation Conf"},{"key":"ref23","volume":"1","author":"breuer","year":"1972","journal-title":"Design Automation of Digital Systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5009041"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1109\/T-C.1971.223129","article-title":"fault equivalence in combinational logic networks","volume":"c 20","author":"mccluskey","year":"1971","journal-title":"IEEE Transactions on Computers"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35192\/01675567.pdf?arnumber=1675567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:39:49Z","timestamp":1638200389000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1675567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,4]]},"references-count":31,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tc.1980.1675567","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1980,4]]}}}