{"title":"基于sfg跟踪方法的CATHEDRAL-I硅编译器验证策略","authors":"F. Proesmans, L. Claesen, M. Genoe, E. Verlind","doi":"10.1109/CMPEUR.1992.218493","DOIUrl":null,"url":null,"abstract":"The application strategy is described of a new verification methodology on the CATHEDRAL-I silicon compiler. The basic goal is to prove the feasibility of an automated verification process based on the presented SFG-tracing concept. This methodology permits the overall evaluation of the lower-level implementation versus the high-level behavioral signal flow graph. Gradually, correspondences between specific signals, called references signals, at the different design levels are mapped during the architecture synthesis. Efficient behavior comparison can be started as soon as those relationships are traced accurately and completely. This task was handled with the aid of the compiled-code symbolic simulator COSMOS.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Verification strategy of the CATHEDRAL-I silicon compiler based on the SFG-tracing methodology\",\"authors\":\"F. Proesmans, L. Claesen, M. Genoe, E. Verlind\",\"doi\":\"10.1109/CMPEUR.1992.218493\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The application strategy is described of a new verification methodology on the CATHEDRAL-I silicon compiler. The basic goal is to prove the feasibility of an automated verification process based on the presented SFG-tracing concept. This methodology permits the overall evaluation of the lower-level implementation versus the high-level behavioral signal flow graph. Gradually, correspondences between specific signals, called references signals, at the different design levels are mapped during the architecture synthesis. Efficient behavior comparison can be started as soon as those relationships are traced accurately and completely. This task was handled with the aid of the compiled-code symbolic simulator COSMOS.<<ETX>>\",\"PeriodicalId\":390273,\"journal\":{\"name\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"volume\":\"6 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.218493\",\"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.218493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Verification strategy of the CATHEDRAL-I silicon compiler based on the SFG-tracing methodology
The application strategy is described of a new verification methodology on the CATHEDRAL-I silicon compiler. The basic goal is to prove the feasibility of an automated verification process based on the presented SFG-tracing concept. This methodology permits the overall evaluation of the lower-level implementation versus the high-level behavioral signal flow graph. Gradually, correspondences between specific signals, called references signals, at the different design levels are mapped during the architecture synthesis. Efficient behavior comparison can be started as soon as those relationships are traced accurately and completely. This task was handled with the aid of the compiled-code symbolic simulator COSMOS.<>