A Compositional Proof System for Dynamic Process Creation

Abstract

A compositional proof systems for a parallel language, P, with dynamic process creation is presented. It is shown how a dynamic system of processes can be described in terms of specifications of the local processes which involve a characterization of their interface with the environment. The proof system formalizes reasoning about these interfaces on an abstraction level that is at least as high as that of the programming language. The programming language P is described, and two assertion languages, the local one and the global one, are defined. The proof system is described and its soundness and completeness are discussed. >