Towards a calculus of data refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 375 LNCS, Issue , 1989, Pages 197-218

  Chen, Wei ^a   Udding, Jan Tijmen ^b  

^a WASHINGTON UNIVERSITY   (United States)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONTEXTUAL INFORMATION; DATA REFINEMENTS; REFINEMENT STEP;

CALCULATIONS;

EID: 24644485295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51305-1_11     Document Type: Conference Paper

References (15)

1. Back R.J.R.: “A calculus of refinements for program derivations”, Acta Informatica 25, pp 593–624, 1988.
2. CrossRefChen, 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.
3. Dahl, O.-J., Dijkstra, E.W. and Hoare, C.A.R.: Structured Programming, Academic Press, London and New York, 1972.
4. Dijkstra, E.W.: A Discipline of Programming, Prentice-Hall, Englewood Cliffs, NJ, 1976.
5. Dijkstra, E.W.: “Extreme solutions of equation(draft of ch.5)”, EWD 912, UT at Austin, Texas, 1985.
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.
7. Hoare, C.A.R.: “Proof of correctness and data representation”, Acta Informatica 1, pp 271–281, 1972.
8. Morgan, C.C.: “Data refinement by miracles”, IPL 26, pp 243–246, 1987/88.
9. Morgan, C.C.: “The specification statement”, ACM TOPLAS 10, pp 403–419, 1988.
10. Morgan, C.C.: Personal communication, September 1988.
11. Morgan, C.C. and Robinson, K.: “Specification statements and refinement”, IBM J. Res. Develop. 31, pp 546–555, 1987.
12. Morris, J.M.: “A theoretical basis for stepwise refinement and the programming calculus”, Sci. of Comp. Prog. 9, pp 287–306, 1987.
13. Owicki S. and Gries D.: “An axiomatic proof technique for parallel programs”, Acta Informatica 6, pp 319–340, 1976.
14. Park, D.: “On the semantics of fair parallelism”, in: Abstract Software Specification, LNCS 86, pp 504–526, 1980.
15. Wirth, N.: “Program development by stepwise refinement”, CACM 14, pp 221–227, 1971.