Abstract
Techniques for describing and verifying modular systems are illustrated using a simple network mail problem. The design is presented in a top-down style. At each level of refinement, the specifications of the higher level are verified from the specifications of lower level components.
This work was partially supported by the Air Force Office of Scientific Research under Contract No. F49620-77-C-0045.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Owicki, S., Specifications and Proofs for Abstract Data Types in Concurrent Programs, in this volume.
Brinch Hansen, P., Network, a Multiprocessor Program. IEEE Trans on Software Engineering, v. 4, no. 3 (May, 1978) 194–199.
Ambler, A., et al., A Language for Specification and Implementation of Verifiable Programs. Proc. of an ACM Conference on Language Design for Reliable Software, SIGPLAN Notices v. 12, n.3 (also Operating Systems Review v. 11, n.2, and Software Engineering Notes, v.2, n.2) (1977) 1–10.
Andrews, G., Modula and the Design of a Message Switching Communications System. TR78-329, Cornell University, Computer Science Dept. (1978)
Owicki, S., Verifying Parallel Programs with Resource Allocation. Proc. International Conference on Math. Studies of Information Processing, Kyoto, Japan (1978).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Owicki, S.S. (1979). Specification and verification of a network mail system. In: Bauer, F.L., et al. Program Construction. Lecture Notes in Computer Science, vol 69. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014669
Download citation
DOI: https://doi.org/10.1007/BFb0014669
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09251-3
Online ISBN: 978-3-540-35312-6
eBook Packages: Springer Book Archive