Skip to main content
SpringerLink
Log in
Book cover

International Conference on Mathematics of Program Construction

MPC 1989: Mathematics of Program Construction pp 197–218Cite as

Towards a calculus of data refinement

  • Contributed Lectures
  • Conference paper
  • First Online:

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

Abstract

In this paper we lay a foundation for a calculus of data refinement. We introduce the concept of conditional data refinement which enables us to incorporate contextual information in a refinement step. We give a number of its properties and show in several examples how data refinement can be used in practice.

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. Back R.J.R.: “A calculus of refinements for program derivations”, Acta Informatica 25, pp 593–624, 1988.

    Article  Google Scholar 

  2. Chen, W. and Udding, J.T., “Towards a Calculus of Data Refinement”, Computing Science Notes CS8902, Dept. of Mathematics and Computing Science, Groningen University, Groningen, The Netherlands, 1989.

    Google Scholar 

  3. Dahl, O.-J., Dijkstra, E.W. and Hoare, C.A.R.: Structured Programming, Academic Press, London and New York, 1972.

    Google Scholar 

  4. Dijkstra, E.W.: A Discipline of Programming, Prentice-Hall, Englewood Cliffs, NJ, 1976.

    Google Scholar 

  5. Dijkstra, E.W.: “Extreme solutions of equation(draft of ch.5)”, EWD 912, UT at Austin, Texas, 1985.

    Google Scholar 

  6. Gries, D. and Prins, J.: “A new notion of encapsulation”, in: Proceedings of Symposium on Language Issues in Programming Environments, pp 131–139, SIGPLAN June 1985.

    Google Scholar 

  7. Hoare, C.A.R.: “Proof of correctness and data representation”, Acta Informatica 1, pp 271–281, 1972.

    Article  Google Scholar 

  8. Morgan, C.C.: “Data refinement by miracles”, IPL 26, pp 243–246, 1987/88.

    Google Scholar 

  9. Morgan, C.C.: “The specification statement”, ACM TOPLAS 10, pp 403–419, 1988.

    Article  Google Scholar 

  10. Morgan, C.C.: Personal communication, September 1988.

    Google Scholar 

  11. Morgan, C.C. and Robinson, K.: “Specification statements and refinement”, IBM J. Res. Develop. 31, pp 546–555, 1987.

    MathSciNet  Google Scholar 

  12. Morris, J.M.: “A theoretical basis for stepwise refinement and the programming calculus”, Sci. of Comp. Prog. 9, pp 287–306, 1987.

    Google Scholar 

  13. Owicki S. and Gries D.: “An axiomatic proof technique for parallel programs”, Acta Informatica 6, pp 319–340, 1976.

    Article  Google Scholar 

  14. Park, D.: “On the semantics of fair parallelism”, in: Abstract Software Specification, LNCS 86, pp 504–526, 1980.

    Google Scholar 

  15. Wirth, N.: “Program development by stepwise refinement”, CACM 14, pp 221–227, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Washington University, 63130, St. Louis, MO

    Wei Chen

  2. Department of Mathematics and Computing Science, Groningen University, Groningen, The Netherlands

    Jan Tijmen Udding

Authors
  1. Wei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Tijmen Udding
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. L. A. van de Snepscheut

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, W., Udding, J.T. (1989). Towards a calculus of data refinement. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-51305-1_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51305-6

  • Online ISBN: 978-3-540-46191-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation