Lectures on Data Refinement
These lectures discuss the notion of data refinement: the replacement of one or more variables in a program by other variables, with suitable replacement of expressions and statements, to yield an equivalent program.
KeywordsCoordinate Transformation Hash Table Predicate Calculus Conditional Statement Proof Obligation
Unable to display preview. Download preview PDF.
- Aho, A.V., J.E. Hopcroft and J.D. Ullman. Date Structures and Algorithms. Addison-Wesley, Reading, 1985, 96–102.Google Scholar
- Back, R.-J. On the correctness of refinement steps in program development. Report A-1978-4, Computer Science Department, University of Helsinki, 1978.Google Scholar
- Chen, W., and J.T. Udding. Towards a calculus of data refinement. LNCS 375, Mathematics of Program Construction, Springer Verlag, New York, 1989.Google Scholar
- Dijkstra, E.W., and C.S. Scholten. Predicate Calculus and Program Semantics. Springer Verlag, New York, 1989.Google Scholar
- Gries, D., and J. van de Snepscheut. Inorder traversal of a binary tree and its inversion. Tech. Rpt. 87–876, Computer Science Department, Cornell University, November 1987.Google Scholar
- Gries, D., and D. Volpano. The Transform -a new language construct. Structured Programming 11 (January 1990), 1–10.Google Scholar
- Knuth, D.E. The Art of Programming, Vol I, Fundamental Algorithms. Addison-Wesley, Reading, 1963.Google Scholar
- Lutz, E. IPL.Google Scholar