{"title":"为什么部分设计验证比它应该做的更好","authors":"J. Savir","doi":"10.1109/DAC.1988.14846","DOIUrl":null,"url":null,"abstract":"The problem of verifying the correctness of a combinatorial design is known to be NP-complete. Nevertheless, most products reaching the consumer are functionally correct. The author attempts to explain this phenomenon by considering the effort of going through a less-than-perfect design-verification process and then explains why many design errors are relatively easily caught.<<ETX>>","PeriodicalId":230716,"journal":{"name":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Why partial design verification works better than it should\",\"authors\":\"J. Savir\",\"doi\":\"10.1109/DAC.1988.14846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of verifying the correctness of a combinatorial design is known to be NP-complete. Nevertheless, most products reaching the consumer are functionally correct. The author attempts to explain this phenomenon by considering the effort of going through a less-than-perfect design-verification process and then explains why many design errors are relatively easily caught.<<ETX>>\",\"PeriodicalId\":230716,\"journal\":{\"name\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"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.14846\",\"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.14846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Why partial design verification works better than it should
The problem of verifying the correctness of a combinatorial design is known to be NP-complete. Nevertheless, most products reaching the consumer are functionally correct. The author attempts to explain this phenomenon by considering the effort of going through a less-than-perfect design-verification process and then explains why many design errors are relatively easily caught.<>