{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:57:33Z","timestamp":1725512253749},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708889"},{"type":"electronic","value":"9783540708896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70889-6_3","type":"book-chapter","created":{"date-parts":[[2007,5,10]],"date-time":"2007-05-10T14:04:16Z","timestamp":1178805856000},"page":"34-49","source":"Crossref","is-referenced-by-count":2,"title":["Extracting a Simplified View of Design Functionality Based on Vector Simulation"],"prefix":"10.1007","author":[{"given":"Onur","family":"Guzey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-C.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hillel","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magdy S.","family":"Abadir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Aharon, A., et al.: Test Program Generation for Functional Verification of PowerPC Processors in IBM. In: Proc. DAC, pp. 279\u2013285 (1995)","DOI":"10.1145\/217474.217542"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Chen, L., et al.: A Scalable Sofware-Based Self-Test Methodology for Programmable Processors. In: Proc. Design Automation Conf., Anaheim, pp. 548\u2013553 (2003)","DOI":"10.1145\/775832.775973"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Wen, C., et al.: On A Software-Based Self-Test Methodology and Its Application. In: Proc. VLSI Test Symp., Palm Springs (2005)","DOI":"10.1109\/VTS.2005.59"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Wen, C., Wang, L., Chang, K.-T.: Simulation-Based Functional Test Generation for Embedded Processors. To be accepted in IEEE Transaction on Computer (2006)","DOI":"10.1109\/TC.2006.186"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"R.E. Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic Boolean Manipulation with Ordered Binary- Decision Diagrams. ACM Computing Surveys\u00a024(3), 293\u2013318 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"11","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L.: A theory of the learnable. Communications of the ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"3_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Kearns, M., et al.: On the learnability of Boolean formulae. In: Proc. 19th Symp. on Theory of Computing, pp. 285\u2013295 (1987)","DOI":"10.1145\/28395.28426"},{"key":"3_CR9","unstructured":"Kearns, M., Valiant, L.: Learning Boolean formulae or finite automata is as hard as factoring. Technical Report TR-14-88, Harvard University (1988)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/174130.174138","volume":"40","author":"N. Linial","year":"1993","unstructured":"Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, Fourier transform, and learnability. J. of ACM\u00a040(3), 607\u2013620 (1993)","journal-title":"J. of ACM"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1011034100370","volume":"40","author":"Y. Mansour","year":"2000","unstructured":"Mansour, Y.: Implementation Issues in the Fourier Transform Algorithm. Machine Learning\u00a040, 5\u201333 (2000)","journal-title":"Machine Learning"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1162\/neco.1991.3.2.246","volume":"3","author":"J. Park","year":"1991","unstructured":"Park, J., Sandberg, I.W.: Universal approximation using radial-basis-function networks. Neural Computation\u00a03(2), 246\u2013257 (1991)","journal-title":"Neural Computation"},{"key":"3_CR13","first-page":"301","volume-title":"Proc. 12th ACM Symp. Theory Comput.","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation. In: Proc. 12th ACM Symp. Theory Comput., pp. 301\u2013309. ACM Press, New York (1988)"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0747-7171(08)80018-1","volume":"9","author":"R. Zippel","year":"1990","unstructured":"Zippel, R.: Interpolating polynomials from their values. J. Symb. Comput.\u00a09(3), 375\u2013403 (1990)","journal-title":"J. Symb. Comput."},{"key":"3_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/b97417","volume-title":"Interpolation and Approximation by Polynomials","author":"G.M. Phillips","year":"2003","unstructured":"Phillips, G.M.: Interpolation and Approximation by Polynomials. Springer, Heidelberg (2003)"},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. Schwartz","year":"1980","unstructured":"Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. Jour. ACM\u00a027(4), 701\u2013717 (1980)","journal-title":"Jour. ACM"},{"key":"3_CR17","unstructured":"OpenRISC 1200 at http:\/\/www.opencores.org\/"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software, Verification and Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70889-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T19:36:22Z","timestamp":1683833782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70889-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540708889","9783540708896"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70889-6_3","relation":{},"subject":[]}}