arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.1032cs.SEcs.LO
收藏

本地推理中的足迹

Footprints in Local Reasoning

Mohammad Raza, Philippa Gardner

摘要:

关于程序的局部推理通过关注足迹(程序访问的资源部分)来利用程序中常见的自然局部行为。我们解决的问题,形式化的特征和分析的足迹概念的抽象局部功能介绍的Calcagno,O赫恩和杨。通过我们的定义,我们证明了足迹是一个完整的本地功能规范所需的唯一基本元素。我们正式的小规格的概念,在本地推理,并表明,良好的基础资源模型,一个最小的规格总是存在,只包括的足迹,也提出了结果的非良好的情况下。最后,我们使用这个理论的足迹调查的条件下,足迹对应于最小的安全状态。我们提出了一个新的模型的RAM中,与标准模型不同,每个程序的足迹对应于最小的安全状态,我们还确定了一个一般条件的原始命令的程序设计语言,保证这个属性的任意模型。

英文摘要:

Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address the problem of formally characterising and analysing the footprint notion for abstract local functions introduced by Calcagno, O Hearn and Yang. With our definition, we prove that the footprints are the only essential elements required for a complete specification of a local function. We formalise the notion of small specifications in local reasoning and show that for well-founded resource models, a smallest specification always exists that only includes the footprints, and also present results for the non-well-founded case. Finally, we use this theory of footprints to investigate the conditions under which the footprints correspond to the smallest safe states. We present a new model of RAM in which, unlike the standard model, the footprints of every program correspond to the smallest safe states, and we also identify a general condition on the primitive commands of a programming language which guarantees this property for arbitrary models.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑