Abstract
A method of specifying interactive programs by production rules is described, and the Floyd-Hoare assertional method is modified to permit one to prove that a program correctly implements its specification. A program to accept and format typed input is formally specified, and its implementation with a TECO program is proved correct.
SRI International
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R.W. Floyd, "Assigning Meanings to Programs", in Proc. Symp. Appl. Math, vol. 19 (1967), Amer. Math. Soc., 19–32.
C.A.R. Hoare, "An Axiomatic Basis for Computer Programming", Comm. ACM 12, 10 (October 1969), 576–583.
J.V. Guttag, E. Horowitz, and D.R. Musser, "The Design of Data Type Specifications", in Current Trends in Programming Methodology, Vol IV: Data Structuring, R.T.Yeh, Ed., Prentice Hall, 1978.
E.W. Dijkstra, "Guarded Commands, Nondeterminacy and Formal Derivation of Programs", Comm. ACM 18, 8 (Aug. 1975) 453–457.
Z. Manna and A. Pnueli, "Axiomatic Approach to Total Correctness of Programs", Acta Informatica 3 (1974), 243–264.
TENEX Text Editor and Corrector Manual, Bolt Beranek and Newman, Inc., Cambridge, Mass.
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamport, L. (1979). The specification and proof of correctness of interactive programs. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_37
Download citation
DOI: https://doi.org/10.1007/3-540-09541-1_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09541-5
Online ISBN: 978-3-540-35010-1
eBook Packages: Springer Book Archive