Skip to main content
SpringerLink
Log in

Proof of correctness of data representations

  • Chapter 2.: Program Development
  • Conference paper
  • First Online:
Language Hierarchies and Interfaces

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

Abstract

A powerful method of simplifying the proofs of program correctness is suggested; and some new light is shed on the problem of functions with side-effects.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wirth, N.: The development of programs by stepwise refinement. Comm. ACM. 14, 221–227 (1971).

    Google Scholar 

  2. Dijkstra, E. W.: Notes on structured programming. In Structured Programming. Academic Press (1972).

    Google Scholar 

  3. Hoare, C. A. R.: Notes on data structuring. Ibid.

    Google Scholar 

  4. Dahl, O.-J.: Hierachical program structures. Ibid.

    Google Scholar 

  5. Milner, R.: An algebraic definition of simulation between programs. CS 205 Stanford University, February 1971.

    Google Scholar 

  6. Dijkstra, E. W.: A constructive approach to the problem of program correctness. BIT. 8, 174–186 (1968).

    Google Scholar 

  7. Dahl, O.-J., Myhrhaug, B., Nygaard, K.: The Simula 67 common base language. Norwegian Computing Center, Oslo, Publication No. S-22, 1970.

    Google Scholar 

  8. Hoare, C. A. R.: An axiomatic approach to computer programming. Comm. ACM. 12, 576–580, 583 (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Queen's University of Belfast, Belfast, Northern Ireland

    C. A. R. Hoare

Authors
  1. C. A. R. Hoare
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedrich L. Bauer E. W. Dijkstra A. Ershov M. Griffiths C. A. R. Hoare W. A. Wulf Klaus Samelson

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hoare, C.A.R. (1976). Proof of correctness of data representations. In: Bauer, F.L., et al. Language Hierarchies and Interfaces. Lecture Notes in Computer Science, vol 46. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07994-7_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-07994-7_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07994-1

  • Online ISBN: 978-3-540-37972-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation