Skip to main content
SpringerLink
Log in

Proof of Correctness of Data Representations

  • Chapter
  • First Online:
Software Pioneers

Summary

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
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

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).

    Article  Google Scholar 

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

    MATH  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).

    Article  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).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, The Queen’s University of Belfast, BT 71 NN, Belfast, Ireland

    Prof. C. A. R. Hoare

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

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Manfred Broy (Professor of Informatics) (Professor of Informatics)

  2. sd&m AG software design & management, Postfach 83 08 51, 81708, München, Germany

    Ernst Denert (Chairman of the Supervisory Board) (Chairman of the Supervisory Board)

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hoare, C.A.R. (2002). Proof of Correctness of Data Representations. In: Broy, M., Denert, E. (eds) Software Pioneers. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59412-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59412-0_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63970-8

  • Online ISBN: 978-3-642-59412-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation