G), where R is a rely condition and G is a guarantee condition. A rely condition expresses
the conditions that P relies on its environment to provide, and a guarantee condition
expresses what P guarantees to provide in return. This paper presents a proof technique
that permits us to infer that a program P satisfies a rely/guarantee specification R⊃ G, given
that we know P satisfies a finite collection of rely/guarantee specifications R i⊃ G i,(i∈ I) …