  The paper gives a detailed presentation of a framework, embedded into the
simply typed higher-order logic and aimed at the support of sound and
structured reasoning about various properties of models of imperative programs
with interleaved computations. As a case study, a model of the Peterson's
mutual exclusion algorithm will be scrutinised in the course of the paper
illustrating applicability of the framework.
