The specification and proof of correctness of interactive programs

  • Leslie Lamport
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)


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.


Production Rule Action List Character String Correctness Proof Interactive Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R.W. Floyd, "Assigning Meanings to Programs", in Proc. Symp. Appl. Math, vol. 19 (1967), Amer. Math. Soc., 19–32.Google Scholar
  2. 2.
    C.A.R. Hoare, "An Axiomatic Basis for Computer Programming", Comm. ACM 12, 10 (October 1969), 576–583.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    E.W. Dijkstra, "Guarded Commands, Nondeterminacy and Formal Derivation of Programs", Comm. ACM 18, 8 (Aug. 1975) 453–457.Google Scholar
  5. 5.
    Z. Manna and A. Pnueli, "Axiomatic Approach to Total Correctness of Programs", Acta Informatica 3 (1974), 243–264.Google Scholar
  6. 6.
    TENEX Text Editor and Corrector Manual, Bolt Beranek and Newman, Inc., Cambridge, Mass.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Leslie Lamport

There are no affiliations available

Personalised recommendations