{"title":"论有效霍尔逻辑的存在性","authors":"M. Grabowski, H. Hungar","doi":"10.1109/LICS.1988.5140","DOIUrl":null,"url":null,"abstract":"Every proof system for (partial) correctness yields an enumeration procedure for correctness assertions. Other researchers have proved results on the existence of (sound and complete) enumeration procedures for assertions about programs from an acceptable programming language where the assertion language is first-order logic. It is shown that some of the assumptions are stronger than necessary, whereas others must not be weakened. Two novel procedures are given that work for more interpretations with a smaller oracle than those known up to now.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On the existence of effective Hoare logics\",\"authors\":\"M. Grabowski, H. Hungar\",\"doi\":\"10.1109/LICS.1988.5140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Every proof system for (partial) correctness yields an enumeration procedure for correctness assertions. Other researchers have proved results on the existence of (sound and complete) enumeration procedures for assertions about programs from an acceptable programming language where the assertion language is first-order logic. It is shown that some of the assumptions are stronger than necessary, whereas others must not be weakened. Two novel procedures are given that work for more interpretations with a smaller oracle than those known up to now.<<ETX>>\",\"PeriodicalId\":425186,\"journal\":{\"name\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1988.5140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1988.5140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Every proof system for (partial) correctness yields an enumeration procedure for correctness assertions. Other researchers have proved results on the existence of (sound and complete) enumeration procedures for assertions about programs from an acceptable programming language where the assertion language is first-order logic. It is shown that some of the assumptions are stronger than necessary, whereas others must not be weakened. Two novel procedures are given that work for more interpretations with a smaller oracle than those known up to now.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
