Reasoning about Program Composition

@inproceedings{Mani1996ReasoningAP,
  title={Reasoning about Program Composition},
  author={K. Mani and Chandyy and Beverly A. Sanders},
  year={1996}
}
This paper presents a theory for concurrent program composition based on a predicate transformer call the the weakest guarantee and a corresponding binary relation guarantees. The theory stems from a novel view of rely-guarantee techniques for reasoning about program composition and provides a general and uniform framework for handling temporal properties as well as other kinds of program properties such as reenement and encapsulation.