Abstract
We discuss data refinement, along with the related idea of a coordinate transformation. We develop a language feature to support the coordinate transformation, called the transform, and discuss its use in developing and re-using programs.
This work was supported jointly by the NSF and Darpa under grant ASC-88-00465. Some of the material in these lecture notes were culled from article [10], coauthored with Dennis Volpano.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, W., and J.T. lidding. Towards a calculus of data refinement. In van de Snepscheut (ed.). Mathematics of Program Construction, Lecture Notes in Computer Science, Vol. 375. Springer—Verlag, 1989.
Chen, W., and J.T. Udding. Towards a calculus of data refinement. TR CS8902, computer science, University of Groningen, March 1989
Dijkstra, E.W. A Discipline of Programming. Prentice Hall, Englewood Cliffs, New Jersey, 1976.
Feijen, W.H.J., A.J.M. van Gasteren, and D. Gries. In-situ inversion of a cyclic permutation. Inf. Process. Lett. 4, 1 (January 1987), 11–14.
Graham, R.L. An efficient algorithm for determining the convex hull of a finite planar set. IPL 1 (1972), 132–133.
Gries, D., and J. Prins. McLaren’s masterpiece. Science of Computer Programming 8 (1987), 139–145.
Gries, D., and J. Prins. A new notion of encapsulation. Proc. SIGPLAN 85 Symposium on Language Issues in Programming Environments. Seattle, Washington, June 1985, 131–139.
Cries, D., and Jan van de Snepscheut. Inorder traversal of a binary tree and its inversion. Tech. Rpt. 87–876, Computer Science Department, Cornell University, November 1987.
Cries, D., and I. Stojmenovic. A note on Graham’s convex hull algorithm. IPL 25, 5 (July 1987), 323–328.
Gries, D., and D. Volpano. The Transform —a new language construct. Structured Programming 11 (January 1990), 1–10.
Hoare, C.A.R. Proof of correctness of data representations. Acta Informatica 1 (1972), 271–281.
Lutz, E. Some proofs of transforms. TR89–1041, Computer Science Department, Cornell, September 1989.
Morgan, C., and P.H.B. Gardiner. Data refinement by calculation. Acta Informatica 27 (1990), 481–503.
Morris, J.M. The laws of data refinement. Acta Informatica 26 (1989), 287–308.
Richards, H., ed. Formal Development of Programs and Proofs. Addison-Wesley, 1989. (Proc. Year of Programming Institute, Austin, Texas, October 1987.)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gries, D. (1993). Data Refinement and the Transform. In: Broy, M. (eds) Program Design Calculi. NATO ASI Series, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02880-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-02880-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08164-4
Online ISBN: 978-3-662-02880-3
eBook Packages: Springer Book Archive