Skip to main content

On proving program correctness by means of stepwise refinement method

  • Conference paper
  • First Online:
  • 111 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 148))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AHO A.V., HOPCROFT J.E., ULLMAN J.D., The design and analysis of computer algorithms, Addison-Wesley, Reading, Mass. 1974

    Google Scholar 

  2. SALWICKI A., An introduction to algorithmic logic, Banach Center Publications, vol.2, PWN, Warsaw, 1977

    Google Scholar 

  3. BANACHOWSKI L., On implementations of abstract data types, 26. Mathematical Logic in Computer Science, Salgotarjan 1978, Coll. Math.Soc.Janos Bolyai, 1981, 143–166

    Google Scholar 

  4. HOARE C.A.R., Proof of correctness of data representation, Acta Inf. 1(1972), 271–281

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Salwicki

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Banachowski, L. (1983). On proving program correctness by means of stepwise refinement method. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-11981-7_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11981-4

  • Online ISBN: 978-3-540-39445-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics