Abstract
The problem of correctness of the solutions to the distributed termination problem of Francez [F] is addressed. Correctness criteria are formalized in the customary framework for program correctness. A very simple proof method is proposed and applied to show correctness of a solution to the problem.
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
Apt, K.R., Ten years of Hoare’s logic, a survey, part II, Theoretical Computer Science 28, pp. 83–109, 1984.
Apt, K.R., Proving correctness of CSP programs, a tutorial, Tech. Report 84–24, LITP, Université Paris 7, 1984 (also to appear in the Proc. International Summer School “Control Flow and Data Flow: Concepts of Distributed Programming”, Marktobedorf, 1984 ).
Apt, K.R. and Clermont Ph., Two normal form theorems for CSP programs, in preparation.
Apt, K.R., Francez N. and De Roever, W.P., A proof system for Communicating Sequential Processes, ACM TOPLAS 2 No 3, pp. 359–385, 1980.
Apt, K.R. and Richier, J.L., Real time clocks versus virtual clocks, Tech. Report 84–34, LITP, Université Paris 7, 1984, (also to appear in the Proc. International Summer School “Control Flow and Data Flow: Concepts of Distributed Programming”, Marktobedorf, 1984 ).
Dijkstra, E.W., Feijen, W.H. and van Gasteren, A.J.M., Derivation of a termination detection algorithm for distributed computations, Inform. Processing Letters 16, 5, pp. 217–219, 1983.
Elrad, T.E. and Francez, N., Decomposition of distributed programs into communication closed layers, Science of Computer Programming 2, No 3, pp. 155–174, 1982.
Francez, N., Distributed termination, ACM TOPLAS 2, No 1, pp. 42–55, 1980.
Francez, N., Roder, M. and Sintzoff, M., Distributed termination with interval assertions, in: Proc. Int Colloq. Formalization of Programming Concepts, Peniscola, Spain, Lecture Notes in Comp. Science, vol. 107, 1981.
Grumberg, O., Francez N., Makowsky J., and De Roever W.P., A proof rule for fair termination of guarded commands, in: J.W. de Bakker and J.C. Van Vhet eds., Algorithmic languages, IFIP, North Holland, Amsterdam, pp. 399–416, 1981.
Hoare, C.A.R., Communicating sequential processes, CACM 21, 8, pp. 666–677, 1978.
Lamport, L., Time, clocks and the ordering of events in a distributed system, CALM 21, 7, pp. 558–565, 1978.
Manna, Z. and Pnueli, A., How to cook a temporal proof system for your pet language, in: Proc. of the Symposium on Principles of Programming Languages, Austin, Texas, 1983.
Topor, R.W., Termination detection for distributed computations, Inform. Processing Letters 18, 1, pp. 33–36, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Apt, K.R. (1985). Correctness Proofs of Distributed Termination Algorithms. In: Apt, K.R. (eds) Logics and Models of Concurrent Systems. NATO ASI Series, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82453-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-82453-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82455-5
Online ISBN: 978-3-642-82453-1
eBook Packages: Springer Book Archive