一类简单程序的等价问题及其正确性公式

Q4 Mathematics
Oscar H. Ibarra , Louis E. Rosier
{"title":"一类简单程序的等价问题及其正确性公式","authors":"Oscar H. Ibarra ,&nbsp;Louis E. Rosier","doi":"10.1016/S0019-9958(85)80018-8","DOIUrl":null,"url":null,"abstract":"<div><p>This paper is concerned with the semantics (or computational power) of very simple loop programs over different sets of primitive instructions. Recently, a complete and consistent Hoare axiomatics for the class of {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>x</em> ← <em>x</em> ∸ 1, <em>do x</em> … <em>end</em>} programs which contain no nested loops, was given, where the allowable assertions were those formulas in the logic of Presburger arithmetic. The class of functions computable by such programs is exactly the class of Presburger functions. Thus, the resulting class of correctness formulas has a decidable validity problem. In this paper, we present simple loop programming languages which are, computationally, strictly more powerful, i.e., which can compute more than the class of Presburger functions. Furthermore, using a logical assertion language that is also more powerful than the logic of Presburger arithmetic, we present a class of correctness formulas over such programs that also has a decidable validity problem.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80018-8","citationCount":"3","resultStr":"{\"title\":\"The equivalence problem and correctness formulas for a simple class of programs\",\"authors\":\"Oscar H. Ibarra ,&nbsp;Louis E. Rosier\",\"doi\":\"10.1016/S0019-9958(85)80018-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper is concerned with the semantics (or computational power) of very simple loop programs over different sets of primitive instructions. Recently, a complete and consistent Hoare axiomatics for the class of {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>x</em> ← <em>x</em> ∸ 1, <em>do x</em> … <em>end</em>} programs which contain no nested loops, was given, where the allowable assertions were those formulas in the logic of Presburger arithmetic. The class of functions computable by such programs is exactly the class of Presburger functions. Thus, the resulting class of correctness formulas has a decidable validity problem. In this paper, we present simple loop programming languages which are, computationally, strictly more powerful, i.e., which can compute more than the class of Presburger functions. Furthermore, using a logical assertion language that is also more powerful than the logic of Presburger arithmetic, we present a class of correctness formulas over such programs that also has a decidable validity problem.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80018-8\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800188\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800188","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 3

摘要

本文关注的是不同原始指令集上非常简单的循环程序的语义(或计算能力)。摘要给出了不含嵌套循环的{x←0,x←y, x←x + 1, x←x±1,do x…end}类程序的一个完备的、一致的Hoare公理,其中允许的断言是Presburger算术逻辑中的那些公式。这类程序可计算的函数类就是普雷斯伯格函数类。因此,所得到的一类正确性公式具有一个可确定的有效性问题。在本文中,我们提出了简单的循环编程语言,它们在计算上严格来说更强大,也就是说,它可以计算比Presburger函数类更多的函数。此外,使用一种比Presburger算法的逻辑更强大的逻辑断言语言,我们给出了一类同样具有可确定有效性问题的程序的正确性公式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The equivalence problem and correctness formulas for a simple class of programs

This paper is concerned with the semantics (or computational power) of very simple loop programs over different sets of primitive instructions. Recently, a complete and consistent Hoare axiomatics for the class of {x ← 0, xy, xx + 1, xx ∸ 1, do xend} programs which contain no nested loops, was given, where the allowable assertions were those formulas in the logic of Presburger arithmetic. The class of functions computable by such programs is exactly the class of Presburger functions. Thus, the resulting class of correctness formulas has a decidable validity problem. In this paper, we present simple loop programming languages which are, computationally, strictly more powerful, i.e., which can compute more than the class of Presburger functions. Furthermore, using a logical assertion language that is also more powerful than the logic of Presburger arithmetic, we present a class of correctness formulas over such programs that also has a decidable validity problem.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
信息与控制
信息与控制 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学术官方微信