Data refinement refined

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

Volumn 213 LNCS, Issue , 1986, Pages 187-196

  He, J ^a   Hoare, C A R ^a   Sanders, J W ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ABSTRACT SPECIFICATIONS; DATA REFINEMENTS; DIJKSTRA; NON-DETERMINISM; PROOF METHODS;

SPECIFICATIONS;

EID: 85034864446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-16442-1_14     Document Type: Conference Paper

References (10)

1. E.W. Dijkstra A Discipline of Programming, Prentice-Hall, Englewood Cliffs, N.J., 1976.
2. H3MS4 Data Refinement Refined, Draft 1, PRG preprint, May, 1985.
3. He. Jifeng, C.A.R. Hoare and J.W. Sanders Data Refinement Refined, to appear.
4. C.A.R. Hoare Proof of correctness of data representations, Acta Informatica, 1, 271-281, 1972.
5. C.A.R. Hoare and He, Jifeng The weakest prespecification, Technical Monograph, PRG-44, June, 1985.
6. C.B. Jones Software Development: A Rigorous Approach, Prentice-Hall International, Englewood Cliffs, N.J., 1980.
7. A.J.R.G. Milner Lectures on a calculus for communicating systems, Lecture notes from the International Summer School on Control Flow and Data Flow, Munich, 1984.
8. T. Nipkow Nondeterministic data types: models and implementations, University of Manchester preprint, March, 1985.
9. D. Park Concurrency and automata on infinite sequences, in LNCS, 104, 167-183, 1981.
10. M.B. Smyth Effectively given domains, TCS, 5, 257-274, 1977.