Compositional assume–guarantee reasoning for input/output component theories

•Contract-based assume–guarantee framework for asynchronous I/O component models.•Operations of parallel, conjunction and quotient defined on contracts.•Sound and complete compositional assume–guarantee rules for operators.•Rules preserve safety and progress properties.

We formulate a sound and complete assume–guarantee framework for reasoning compositionally about components modelled as a variant of interface automata. The specification of a component, which expresses both safety and progress properties of input and output interactions with the environment, is characterised by finite traces. The framework supports dynamic reasoning about components and specifications, and includes rules for parallel composition, logical conjunction and disjunction corresponding to independent development, and quotient for incremental synthesis. Practical applicability of the framework is demonstrated through a link layer protocol case study.