arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.03352cs.LOcs.SE
收藏

同步程序代数:关于共享内存和基于事件的并发性的推理基础

A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency

Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter, Robert J. Colvin

摘要:

这项研究开始于一个代数推理的依赖/保证并发共享内存模型。所采取的方法导致了一个更抽象的原子步骤代数,其中原子步骤在并行组合时同步(而不是交错)。然后,依赖/保证并发的代数就变成了更抽象的代数的实例化。依赖/保证推理所需的许多核心属性可以在抽象代数中证明,在那里它们的证明更简单,因此允许更高程度的自动化。代数已被编码在Isabelle/HOL的工具支持程序验证提供了基础。在依赖/保证并发中,程序被指定为保证某些行为,直到违反关于其环境行为的假设。当假设被违反时,程序行为不受约束(中止),保证不再需要保持。为了支持这些保证,引入了第二个同步操作符,弱合取:弱合取中的两个进程必须同意采取每一个原子步骤,除非其中一个进程中止,否则整个进程都会中止。在发展平行和弱合取律的过程中,我们发现许多性质是算子共有的,而且许多律的证明在本质上是相同的。这种见解导致了将同步推广到抽象运算符的想法,只有平行运算符和弱合取运算符共享的公理,因此这两个运算符可以被视为抽象同步运算符的实例。平行和弱合取之间的主要区别在于它们如何组合单个原子步骤;这在抽象运算符的公理中是开放的。

英文摘要:

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave) when composed in parallel. The algebra of rely/guarantee concurrency then becomes an instantiation of the more abstract algebra. Many of the core properties needed for rely/guarantee reasoning can be shown to hold in the abstract algebra where their proofs are simpler and hence allow a higher degree of automation. The algebra has been encoded in Isabelle/HOL to provide a basis for tool support for program verification. In rely/guarantee concurrency, programs are specified to guarantee certain behaviours until assumptions about the behaviour of their environment are violated. When assumptions are violated, program behaviour is unconstrained (aborting), and guarantees need no longer hold. To support these guarantees a second synchronous operator, weak conjunction, was introduced: both processes in a weak conjunction must agree to take each atomic step, unless one aborts in which case the whole aborts. In developing the laws for parallel and weak conjunction we found many properties were shared by the operators and that the proofs of many laws were essentially the same. This insight led to the idea of generalising synchronisation to an abstract operator with only the axioms that are shared by the parallel and weak conjunction operator, so that those two operators can be viewed as instantiations of the abstract synchronisation operator. The main differences between parallel and weak conjunction are how they combine individual atomic steps; that is left open in the axioms for the abstract operator.

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

↑