On proving program correctness by means of stepwise refinement method

  • Lech Banachowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 148)


Common Variable Main Program Total Correctness Correct Implementation Algorithmic Logic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    AHO A.V., HOPCROFT J.E., ULLMAN J.D., The design and analysis of computer algorithms, Addison-Wesley, Reading, Mass. 1974Google Scholar
  2. [2]
    SALWICKI A., An introduction to algorithmic logic, Banach Center Publications, vol.2, PWN, Warsaw, 1977Google Scholar
  3. [3]
    BANACHOWSKI L., On implementations of abstract data types, 26. Mathematical Logic in Computer Science, Salgotarjan 1978, Coll. Math.Soc.Janos Bolyai, 1981, 143–166Google Scholar
  4. [4]
    HOARE C.A.R., Proof of correctness of data representation, Acta Inf. 1(1972), 271–281Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Lech Banachowski
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityPoland

Personalised recommendations