{"title":"正式验证的索贝尔图像处理芯片","authors":"P. Narendran, J. Stillman","doi":"10.1109/DAC.1988.14760","DOIUrl":null,"url":null,"abstract":"An approach is described for hardware verification in the context of the authors' recent success in formally verifying the description of an image-processing chip. They demonstrate that their approach, which uses an implementation of an equational approach to theorem proving developed by D. Kapur and P. Narendran (1985), can be a viable alternative to simulation. In particular, they are able to take advantage of the recursive nature of many circuits, such as n-bit adders, and their techniques allow verification of sequential circuits. To the best of their knowledge this is the first time a complex sequential circuit which was not designed with formal verification specifically in mind has been verified. They describe the discovery of several design errors in the circuit description, detected during the verification attempt (the actual verification could only take place once these errors were removed).<<ETX>>","PeriodicalId":230716,"journal":{"name":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Formal verification of the Sobel image processing chip\",\"authors\":\"P. Narendran, J. Stillman\",\"doi\":\"10.1109/DAC.1988.14760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An approach is described for hardware verification in the context of the authors' recent success in formally verifying the description of an image-processing chip. They demonstrate that their approach, which uses an implementation of an equational approach to theorem proving developed by D. Kapur and P. Narendran (1985), can be a viable alternative to simulation. In particular, they are able to take advantage of the recursive nature of many circuits, such as n-bit adders, and their techniques allow verification of sequential circuits. To the best of their knowledge this is the first time a complex sequential circuit which was not designed with formal verification specifically in mind has been verified. They describe the discovery of several design errors in the circuit description, detected during the verification attempt (the actual verification could only take place once these errors were removed).<<ETX>>\",\"PeriodicalId\":230716,\"journal\":{\"name\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1988.14760\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1988.14760","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal verification of the Sobel image processing chip
An approach is described for hardware verification in the context of the authors' recent success in formally verifying the description of an image-processing chip. They demonstrate that their approach, which uses an implementation of an equational approach to theorem proving developed by D. Kapur and P. Narendran (1985), can be a viable alternative to simulation. In particular, they are able to take advantage of the recursive nature of many circuits, such as n-bit adders, and their techniques allow verification of sequential circuits. To the best of their knowledge this is the first time a complex sequential circuit which was not designed with formal verification specifically in mind has been verified. They describe the discovery of several design errors in the circuit description, detected during the verification attempt (the actual verification could only take place once these errors were removed).<>