A hardware implementation of the CSP primitives and its verification
A design for a hardware interface that implements CSP-like communication primitives is presented. The design is based on a bus scheme that allows processes to “eavesdrop” on messages not directly addressed to them. A temporal logic specification is given for the network and an outline of a verification proof is sketched.
KeywordsTemporal Logic Hardware Implementation Associative Memory Proof System Safety Property
Unable to display preview. Download preview PDF.
- [H]C.A.R. Hoare “Communicating Sequential Processes', Communications of the ACM, Vol. 21, No. 8, 666–677, August 1978.Google Scholar
- [MP1]Z. Manna and A. Pnueli, “Verification of Concurrent Programs: Temporal Proof Principles”, Proc. of the Workshop on Logic of Programs (D. Kozen, ed.), Yorktown Heights, NY (1981).Google Scholar
- [MP2]Z. Manna and A. Pnueli, “Verification of Concurrent Programs: A Temporal Proof System”, Proc. 4th School on Advanced Programming, Amsterdam, The Netherlands (June 1982).Google Scholar
- [R]D. Ron, “Temporal Verification of Communication Protocols”, M.Sc. Thesis, Weizmann Institute.Google Scholar
- [Ros]F. Rosemberg, “Final Report”, Dept. of Applied Mathematics, The Weizmann Institute of Science, July 1983.Google Scholar
- [RRP]D. Ron, F. Rosemberg and A. Pnueli, “Verification of a Hardware Implementation of the CSP Primitives”. In preparation.Google Scholar