Abstract

. The paper addresses the problem of compositional specification and verification of reactive modules by temporal logic. We consider programs formed by parallel composition of modules that communicate by either shared variables or message passing . Each module specifies its interface with other modules by identifying the communication variables or channels on which it may write and those from which it may only read . We introduce the notion of modular validity by which a formula ' is modularly valid over a module M if it is satisfied by any system in which M is a component. This leads to a simple proof rule in which, if ' 1 is modularly valid over M 1 and ' 2 is modularly valid over M 2 , then ' 1 ' 2 is (modularly) valid over their parallel composition. We show how to prove modular validity, and give examples of compositional proofs using this approach, as well as suggestions for decomposing a global specification of an entire program into a set of modular specifications for its co...

Citations