A Structural Proof of the Soundness of Rely/guarantee Rules
A Structural Proof of the Soundness of Rely/guarantee Rules
复制标题
信赖/担保规则健全性的结构证明
DOI:
10.1093/logcom/exm030
复制
发表时间:
2007
影响因子:
0.7
通讯作者:
Coleman J
中科院分区:
文献类型:
--
作者:
Coleman J
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. This article illustrates such a set of rules and proves their soundness. The underlying concurrent language allows fine-grained interleaving and nested concurrency; it is defined by an operational semantics; the proof that the rely/guarantee rules are consistent with that semantics (including termination) is by a structural induction. A key lemma which relates the states which can arise from the extra interference that results from taking a portion of the program out of context makes it possible to do the proofs without having to perform induction over the computation history. This lemma also offers a way to think about expressibility issues around auxiliary variables in rely/guarantee conditions.
登录
查看更多内容
影响因子:
1.1
作者:
Cliff B. Jones
通讯作者:
Cliff B. Jones
DOI:
--
发表时间:
2007
期刊:
Formal Methods and Hybrid Real-Time Systems
影响因子:
--
作者:
Cliff B. Jones;I. Hayes;M. A. Jackson
通讯作者:
M. A. Jackson
DOI:
--
发表时间:
2003
期刊:
FME
影响因子:
--
作者:
I. Hayes;M. Jackson;Cliff B. Jones
通讯作者:
Cliff B. Jones
DOI:
--
发表时间:
1969
期刊:
影响因子:
--
作者:
P. Lucas;K. Walk
通讯作者:
K. Walk
DOI:
--
发表时间:
1987
期刊:
影响因子:
--
作者:
Cliff B. Jones
通讯作者:
Cliff B. Jones