{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:53Z","timestamp":1725455873003},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0018367","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:31:37Z","timestamp":1132637497000},"page":"39-51","source":"Crossref","is-referenced-by-count":3,"title":["Automatic test pattern generation on multiprocessors: a summary of results"],"prefix":"10.1007","author":[{"given":"Sunil","family":"Arvindam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Nageshwara Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vineet","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"S. Arvindam, V. Kumar, V.N. Rao and V. Singh. Automatic Test Pattern Generation on Multiprocessors. MCC Tech Report ACT-OODS-240-89, 1989."},{"key":"4_CR2","volume-title":"Design of Testable Logic Circuits","author":"R.G. Bennetts","year":"1984","unstructured":"R.G. Bennetts. Design of Testable Logic Circuits. Addison-Wesley, Reading, Massachusetts, 1984."},{"key":"4_CR3","unstructured":"F. Brglez and H. Fujiwara. Neutral Netlist of Ten Combinational Benchmark Circuits and a Target Translator in Fortran. In Special Session on ATPG and Fault Simulation, Proceedings of IEEE International Symposium on Circuits and Systems, July 1985."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P. Goel. Test Generation Cost Analysis and Projections. In Proceedings, 17th Design Automation Conference, June 1980.","DOI":"10.1145\/800139.804515"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TC.1981.1675757","volume":"C-30","author":"P. Goel","year":"1981","unstructured":"P. Goel. An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits. IEEE Trans. on Computers, C-30:215\u2013222, March 1981.","journal-title":"IEEE Trans. on Computers"},{"issue":"6","key":"4_CR6","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF01389001","volume":"16","author":"V. Kumar","year":"1987","unstructured":"V. Kumar and V. N. Rao. Parallel Depth-First Search, Part II: Analysis. International Journal of Parallel Programming, 16 (6):501\u2013519, 1987.","journal-title":"International Journal of Parallel Programming"},{"key":"4_CR7","unstructured":"V. Kumar and V. N. Rao. Load balancing on the Hypercube Architecture. In Proceedings, Fourth Conf. on Hypercubes, Concurrent Computers and Applications, March 1989."},{"key":"4_CR8","unstructured":"V. Kumar et al.. Working Manuscript."},{"key":"4_CR9","unstructured":"A. Motohara, K. Nishimura, H. Fujiwara and I. Shirakawa. A Parallel Scheme for Test Pattern Generation. In Proceedings, Intl. Conference on Computer-Aided Design, 1986, pages 156\u2013159."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"S. Patil and P. Banerjee. A Parallel Branch-and-Bound Algorithm for Test Generation. Proceedings of the 26th ACM\/IEEE Design Automation Conference, 1989.","DOI":"10.1145\/74382.74439"},{"issue":"6","key":"4_CR11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/BF01389000","volume":"16","author":"V.N. Rao","year":"1987","unstructured":"V.N. Rao and V. Kumar. Parallel Depth-First Search, Part I: Implementation. International Journal of Parallel Programming, 16 (6):479\u2013499, 1987.","journal-title":"International Journal of Parallel Programming"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"V.N. Rao and V. Kumar. Superlinear Speedup in State-Space Search. In Proceedings, Conference on Foundations of Software Technology and Theoretical Computer Science, December 1988.","DOI":"10.1007\/3-540-50517-2_79"}],"container-title":["Lecture Notes in Computer Science","Knowledge Based Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0018367.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:41:14Z","timestamp":1607550074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0018367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528504"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0018367","relation":{},"subject":[]}}