Abstract
The two concepts presented here, namely the totalizing function and the precondition of persistence, appear to be simple and, yet, to permit a systematic covering of the set of histories of a program by subsets where program components can be applied independently and safely. In spite of the pending problems, the proposed principles already allow to improve or reconstruct some useful techniques of verification or design which are not always well linked.
Preview
Unable to display preview. Download preview PDF.
References
Denning, P. J., Third generation computer systems, Computing Surveys, 3, 4(Dec. 1971), 175–216.
Dijkstra, E. W., A Discipline of Programming, Prentice-Hall, Englewood Cliffs, 1976.
Habermann, A. N., Synchronization of communicationg processes, CACM 15(1972), 171–176.
Keller, R. M., Formal verification of parallel programs, CACM 19(1976), 371–384.
Lamport, L., Proving the correctness of multiprocess programs, IEEE Trans. Soft. Eng., SE-3(1977), 125–143.
Milner, R., An algebraic definition of simulation between programs, Proc. 2nd Intern. Joint Conf. Artif. Intell., 1971, pp. 481–489.
Owicki, S., and D. Gries, An axiomatic proof technique for parallel programs I, Acta Informatica 6(1976), 319–340.
van Lamsweerde, A., and M. Sintzoff, Formal derivation of strongly correct parallel programs, revised version of Report R338, MBLE, Brussels, 1976, to appear in Acta Informatica.
Sintzoff, M., Inventing program construction rules, in: S. Schuman, P. Hibbard (eds.) Constructing Quality Software, North-Holland, 1978, pp. 471–501.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sintzoff, M. (1979). Principles for distributing programs. In: Kahn, G. (eds) Semantics of Concurrent Computation. Lecture Notes in Computer Science, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022478
Download citation
DOI: https://doi.org/10.1007/BFb0022478
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09511-8
Online ISBN: 978-3-540-35163-4
eBook Packages: Springer Book Archive