Compositional proof methods for concurrency: A semantic approach

Abstract

This paper focusses on the mathematical theory of state-based reasoning about program constructs solely through specifications of their parts, without any reliance on their implementation mechanism. That is, the semantic foundations of compositional state-based reasoning about concurrency. The main advantages of a purely semantic approach are that:

• it highlights the very concept of compositional state-based reasoning about concurrency without any syntactic overhead, and

• it serves as a basis for the encoding of the program semantics and corresponding proof rules inside tools such as PVS which support program verification.