Abstract
Recently, formal methods, both assertional (compositional) and algebraic, for developing state-based parallel programs have been studied. This paper presents one of the few not-that-trivial case studies in this area, based on the combined use of both (though mainly assertional) methods. The case study is conducted in a top-down fashion, and we demonstrate that verification can be naturally conducted at the same time as, and combined with, the design of the system.
Part of the research was supported by Sino-British Friendship Scholarship Scheme, while the first author was reading D.Phil. at Oxford University
This is a preview of subscription content, log in via an institution to check access.
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
K.R. Apt. Ten years of Hoare’s logic: a survey-part II: nondeterminism. Theoretical Computer Science 28 83–109 1984.
K.R. Apt and G.D. Plotkin. countable nondeterminism and random assignment. Journal of the ACM 33 4 724–767 1986.
J.C.M. Baeten. Process Algebra. Cambridge Univ Press, 1990.
E. W. Dijkstra. An exercise inspired by the Dutch National Flag. EWD-608, Burroughs, Nuenen, the Netherlands 1977.
W.P. de Roever. The quest for compositionality. in Proc:IFIP Working Conf. The Role of Abstract Models in Computer ScienceNorthHolland, 1985.
C.A.R. Hoare, He, Jifeng and J.W. Sanders. Prespecification in Data Refinement. IPL, 25 71–76 1987.
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, London. 1985.
C.A.R. Hoare et al. Laws of programming. Commun. ACM 30, 8 672–686 1987.
R. T. Gerth, W.P. de Roever and M. Roncken. A study in distributed systems and Dutch patriotism. In M. Joseph (editor) Proc. of the 2nd conf. on Foundations of Software Technology and Theoretical Computer Science. Bangalore, India 1982.
C.B. Jones. Development methods for computer programs including a notion of interference. Dphil. Thesis, Oxford University Computing Laboratory, 1981.
C.B. Jones. Interference resumed. in P. Bailes, editor, AustralianSoftware Engineering Research 1991.
L. Lamport and F.B. Schneider. Pretending atomicity. Research report 29, Digital System Research Center 1989.
R. Milner. Communication and Concurrency. Prentice-Hall International Series in Computer Science, 1989.
S. Owicki and D. Gries. An axiomatic proof technique for parallel programs. Acta Inform. 6 319–340 Springer-Verlag 1976.
K. Stolen. Development of Parallel Programs on Shared Data-structures. Ph.D Thesis, Computer Science Department, Manchester University, 1990.
K. Stolen. An attempt to reason about shared-state concurrency in the style of VDM. in S. Prehn and W. J. Toetenel, editors, Proceedings of VDM 91, LNCS 551, Springer-Verlag, 1991.
Xu Qiwen and He Jifeng. A theory of state-based parallel programming: Part 1. in J. Morris, editor, Proceedings of BCS FACS 4th Refinement Workshop January 1991, Cambridge, Springer-Verlag.
Xu Qiwen and He Jifeng. Laws of parallel programming. Manuscript, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Xu, Q., He, J. (1992). A case study in formally developing state-based parallel programs—the Dutch National Torus. In: Jones, C.B., Shaw, R.C., Denvir, T. (eds) 5th Refinement Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3550-0_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3550-0_16
Publisher Name: Springer, London
Print ISBN: 978-3-540-19752-2
Online ISBN: 978-1-4471-3550-0
eBook Packages: Springer Book Archive