{"title":"门级顺序机的测试生成:算法和实现问题","authors":"E. Macii, A. Lioy, A. Meo","doi":"10.1109/CMPEUR.1992.218499","DOIUrl":null,"url":null,"abstract":"Algorithms and implementation issues concerning a Boolean factorization based test generation package for gate level sequential machines are discussed. Practical aspects like justification and propagation weights computation and targeted test pattern generation are treated in depth, giving both theoretical and pseudo-code solutions. The experimental results showed that the proposed method was effective in generating sufficiently high fault coverage for the standard set of ISCAS'89 benchmark synchronous sequential circuits.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Test generation for gate level sequential machines: algorithms and implementation issues\",\"authors\":\"E. Macii, A. Lioy, A. Meo\",\"doi\":\"10.1109/CMPEUR.1992.218499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algorithms and implementation issues concerning a Boolean factorization based test generation package for gate level sequential machines are discussed. Practical aspects like justification and propagation weights computation and targeted test pattern generation are treated in depth, giving both theoretical and pseudo-code solutions. The experimental results showed that the proposed method was effective in generating sufficiently high fault coverage for the standard set of ISCAS'89 benchmark synchronous sequential circuits.<<ETX>>\",\"PeriodicalId\":390273,\"journal\":{\"name\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPEUR.1992.218499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Test generation for gate level sequential machines: algorithms and implementation issues
Algorithms and implementation issues concerning a Boolean factorization based test generation package for gate level sequential machines are discussed. Practical aspects like justification and propagation weights computation and targeted test pattern generation are treated in depth, giving both theoretical and pseudo-code solutions. The experimental results showed that the proposed method was effective in generating sufficiently high fault coverage for the standard set of ISCAS'89 benchmark synchronous sequential circuits.<>