On relative completeness of Hoare logics

Q4 Mathematics
Michal Grabowski
{"title":"On relative completeness of Hoare logics","authors":"Michal Grabowski","doi":"10.1016/S0019-9958(85)80010-3","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Comput Sci.” (1977), pp. 1–6) is presented. Namely, we show that for a wide class of programming languages the following holds: the set of all partial correctness assertions true in an expressive interpretation <em>I</em> is uniformly dedicable (in <em>I</em>) in the theory of <em>I</em> iff the halting problem is decidable for finite interpretations. In the effect we show that such limitations as effectiveness or Herbrand-definability of interpretation (they are relevant in the previous proofs) can be removed in the case of partial correctness.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80010-3","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Comput Sci.” (1977), pp. 1–6) is presented. Namely, we show that for a wide class of programming languages the following holds: the set of all partial correctness assertions true in an expressive interpretation I is uniformly dedicable (in I) in the theory of I iff the halting problem is decidable for finite interpretations. In the effect we show that such limitations as effectiveness or Herbrand-definability of interpretation (they are relevant in the previous proofs) can be removed in the case of partial correctness.

论霍尔逻辑的相对完备性
本文推广了利普顿的一个定理(第十八届IEEE学术会议,Proc. 18)。发现。计算机科学(1977),第1-6页)。也就是说,我们证明了对于一类广泛的程序设计语言,下列成立:在表达性解释I中为真的所有部分正确性断言的集合在I的理论中是一致可奉献的(在I中),如果暂停问题对于有限解释是可决定的。在结果中,我们表明,在部分正确的情况下,解释的有效性或Herbrand-definability等限制(它们与前面的证明有关)可以消除。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信