{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T02:08:24Z","timestamp":1722910104451},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/apccas.2002.1115137","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T00:51:07Z","timestamp":1056588667000},"page":"119-123","source":"Crossref","is-referenced-by-count":0,"title":["Redundant transformations for BIST testability metrics-based data path allocation"],"prefix":"10.1109","volume":"2","author":[{"given":"L.T.","family":"Yang","sequence":"first","affiliation":[]},{"given":"J.","family":"Muzio","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/43.640616"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1997.643569"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1995.529899"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1145\/127601.127698","article-title":"A data path synthesis method for self-testable designs","author":"papachristou","year":"1991","journal-title":"28th ACM\/IEEE Design Automation Conference DAC"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.1991.139947"},{"article-title":"Optimization of BIST resourcedu ring high-level synthesis","year":"1998","author":"parulkar","key":"ref15"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1145\/217474.217561","article-title":"Data path allocation for synthesizing RTL designs with lower BIST area overhead","author":"parulkar","year":"1995","journal-title":"Proceedings of the 32nd ACM\/IEEE Design Automation Conference"},{"key":"ref17","first-page":"143","article-title":"Lower bounds on test resources for data flow graphs","author":"parulkar","year":"1996","journal-title":"Proceedings of the 33rd ACM\/IEEE Design Automation Conference"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1145\/277044.277191","article-title":"Introducing redundant computations in a behavior for reducing BIST resources","author":"parulkar","year":"1998","journal-title":"Proceedings 1998 Design and Automation Conference 35th DAC (Cat No 98CH36175) DAC"},{"key":"ref19","article-title":"Scheduling data flow graphics for minimizing BIST resources in data paths","author":"parulkar","year":"1998","journal-title":"Proceedings of the Design Automation and Test in Europe (DATE)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008291616071"},{"key":"ref27","first-page":"117","article-title":"Register-transfer level testability analysis and improvement with pseudorandom BIST","author":"yang","year":"1998","journal-title":"Proceedings of the 1st IEEE International Workshop on Design Test and Application (WDTA-98)"},{"key":"ref3","article-title":"Testability analysis and insertion for RTL circuits based on pseudorandom BIST","author":"carletta","year":"1995","journal-title":"Proceedings of International Conference on Computer Design"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1994.527949"},{"key":"ref5","first-page":"337","article-title":"The analysis of parallel BIST by the combined markov chain","author":"chuang","year":"1989","journal-title":"Proceedings of International Test Conference"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1993.580027"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/VTEST.1994.292279"},{"article-title":"Behavioral-structural testability modeling and synthesis for BIST with application to high-level synthesis","year":"1997","author":"baklashov","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.1997.628932"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEST.1991.519708"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/383251.383253"},{"journal-title":"Petri Net Theory and the Modeling of System","year":"1981","author":"peterson","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/43.259939"},{"key":"ref24","article-title":"A high-level data path allocation algorithm based on BIST testability metrics","author":"yang","year":"0","journal-title":"Proceedings of the 2002 WSEAS International Conferences on Electronics and Hardware Engineering (IEHS-02)"},{"key":"ref23","first-page":"409","article-title":"A BIST testability metric-based algorithm to integrate scheduling and allocation in high-level test synthesis","author":"yang","year":"0","journal-title":"Proceedings of the 9th International Symposium on Integrated Circuits Devices and Systems (ISIC-01)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2002.1046201"},{"key":"ref25","first-page":"78","article-title":"An improved BIST testability metric-based high-level test synthesis approach","author":"yang","year":"0","journal-title":"Proceedings of the 2002 International Conference on VLSI (VLSI-02)"}],"event":{"name":"APCCAS. Asia-Pacific Conference on Circuits and Systems","acronym":"APCCAS-02","location":"Bali, Indonesia"},"container-title":["Asia-Pacific Conference on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8182\/24592\/01115137.pdf?arnumber=1115137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T03:31:25Z","timestamp":1585020685000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1115137\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/apccas.2002.1115137","relation":{},"subject":[]}}