{"title":"并发系统的正确性验证","authors":"T. Szmuc","doi":"10.1109/HICSS.1989.48004","DOIUrl":null,"url":null,"abstract":"Formal tools and computer support for correctness verification are proposed. An algebraic process description of the correctness facilitates formal tools aiding correctness proving. Two methods of correctness verification are presented: static verification, corresponding to the verification notion in system programming which is informally described by the software standard; and dynamic correction, which is a generalization of the exception-handling idea. Algorithms for these methods are specified.<<ETX>>","PeriodicalId":325958,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Correctness verification of concurrent systems\",\"authors\":\"T. Szmuc\",\"doi\":\"10.1109/HICSS.1989.48004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Formal tools and computer support for correctness verification are proposed. An algebraic process description of the correctness facilitates formal tools aiding correctness proving. Two methods of correctness verification are presented: static verification, corresponding to the verification notion in system programming which is informally described by the software standard; and dynamic correction, which is a generalization of the exception-handling idea. Algorithms for these methods are specified.<<ETX>>\",\"PeriodicalId\":325958,\"journal\":{\"name\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1989.48004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1989.48004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal tools and computer support for correctness verification are proposed. An algebraic process description of the correctness facilitates formal tools aiding correctness proving. Two methods of correctness verification are presented: static verification, corresponding to the verification notion in system programming which is informally described by the software standard; and dynamic correction, which is a generalization of the exception-handling idea. Algorithms for these methods are specified.<>