Expression Decomposition in a Rely/Guarantee Context

Authors:
Joey W. Coleman
Affiliations:
School of Computing Science, Newcastle University, UK NE1 7RU
Venue:
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Year:
2008

Citing 5
Cited 3

Systematic software development using VDM (2nd ed.)

Systematic software development using VDM (2nd ed.)
Enhancing the tractability of rely/guarantee specifications in the development of interfering operations

Proof, language, and interaction
Axiomatic proof techniques for parallel programs.

Axiomatic proof techniques for parallel programs.
Splitting atoms safely

Theoretical Computer Science
A Structural Proof of the Soundness of Rely/guarantee Rules

Journal of Logic and Computation

A rely-guarantee proof system for x86-TSO

VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Explicit stabilisation for modular rely-guarantee reasoning

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Verification of scalable synchronous queue

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a technique of expression decomposition which allows the use of rely/guarantee development rules that do not assume atomic expression evaluation. This decomposition provides a means of addressing the fact that the logical meaning of expressions relative to a single state and the semantic evaluation of expressions in a fine-grained concurrent language do not provide the same results; in particular, the former results in a single value whereas the latter can result in many possible values. Rely/guarantee development rules tend to depend on the logical meaning of expressions in cases where they are used; expression decomposition identifies where it is safe to do so, and provides some tools for where it is not.