广义可靠保证并发性:代数基础
Generalised rely-guarantee concurrency: An algebraic foundation
摘要:
可靠保证技术允许人们对并发程序进行组合推理。为了处理干扰,该技术使用了依赖和保证条件,这两个条件都是关于状态的二元关系。依赖条件是一个假设,即环境只执行满足依赖关系的原子步骤,而保证是一个承诺,即程序执行的每个原子步骤都满足保证关系。为了更普遍地研究可靠保证推理,在本文中,我们允许干扰表示的过程,而不是一个关系,从而得出更一般的可靠保证法律。利用过程间的弱合取算子将保证关系推广到保证过程,并引入依赖商算子将依赖关系推广到过程。本文主要研究一般可靠保证理论的代数性质。琼斯式的可靠保证理论可以被解释为一般代数理论的模型,因此这里提出的一般定律对该理论成立。
英文摘要:
The rely-guarantee technique allows one to reason compositionally about concurrent programs. To handle interference the technique makes use of rely and guarantee conditions, both of which are binary relations on states. A rely condition is an assumption that the environment performs only atomic steps satisfying the rely relation and a guarantee is a commitment that every atomic step the program makes satisfies the guarantee relation. In order to investigate rely-guarantee reasoning more generally, in this paper we allow interference to be represented by a process rather than a relation and hence derive more general rely-guarantee laws. The paper makes use of a weak conjunction operator between processes, which generalises a guarantee relation to a guarantee process, and introduces a rely quotient operator, which generalises a rely relation to a process. The paper focuses on the algebraic properties of the general rely-guarantee theory. The Jones-style rely-guarantee theory can be interpreted as a model of the general algebraic theory and hence the general laws presented here hold for that theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。