Compositionality, concurrency and partial correctness
Compositionality, concurrency and partial correctness
Using PVS for an Assertional Verification of the RPC-Memory Specification Problem
Formal Systems Specification, The RPC-Memory Specification Case Study (the book grow out of a Dagstuhl Seminar, September 1994)
Verification of a Multiplier: 64 Bits and Beyond
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
We investigate the semantic foundations of a compositional proof method for concurrent systems communicating via synchronous message passing. Beising ourselves on the inductive assertion method for local verification of synchronous transition diagrams which are composed both sequentially and in parallel, we present a compositional proof system that is proved sound and (semantically) complete. The mathematical foundations of this methodology consist of a purely semantic view of predicates as sets of states, the introduction of a virtual history variable into the proofs of basic components, a semantic approximation called involvement of the syntactic notion of occurrence of a variable or a channel within an assertion, and the use of projections as fundamental technique for formulating compositional proof rules.