Affiliations: Department of Mathematics and Computing Science, Eindhoven University of Technology, Postbox 513, 5600 MB Eindhoven, The Netherlands. Electronic mail: mcvax!eutrc3!wsinrobg.UUCP.
Note: [1] A provisional version of this paper appeared in the Proceedings of the NATO Advanced Study Institute on Logics and Models of Concurrent Systems, NATO ASI Series F, Vol.13, Springer-Verlag, 1985.
Note: [*] The author was partially supported by the Foundation for computer science research in the Netherlands (SION) with financial aid from the Netherlands organization for the advancement of pure research (ZWO).
Note: [**] The author is currently working in and partially supported by ESPRIT project 937: “Debugging and Specification of Real-Time Embedded Systems (DESCARTES)”.
Abstract: An axiomatic characterization of monitors, based on assumption-commitment style reasoning, is given that is sound and (relatively) complete. This characterization is based on the fundamental notions of cooperation and interference, but does not use them as second order notions. The cooperation test was originally conceived to capture the proof theoretical analogue of distributed message passing between disjoint processes, as opposed to the interference freedom test, being the proof theoretical analogue of concurrency based on interference by jointly shared variables. Since then, the cooperation test has been applied to characterize synchronous communication in Hoare’s Communicating Sequential Processes, Ichbia’s Ada, and Wirth’s Modula-2, supported by soundness and completeness proofs. An overview is given of the rationale underlying this characterization, culminating in the development of proof systems for a new monitor based programming language for concurrency (Communicating Modules, CM) which combines distributed message passing between processes with interference through local variables of a process which are shared between its sub-processes. As such this is a first step towards the formal verification of object oriented systems. In this context, we also show how the method, traditionally cauched in terms of proof outlines, can be rendered syntax directed in a precise and formal way. In a separate paper, the proof system has been shown to be sound and (relatively) complete.
