Data refinement refined resume

  • J. He
  • C. A. R. Hoare
  • J. W. Sanders
Semantics And Abstract Data Types
Part of the Lecture Notes in Computer Science book series (LNCS, volume 213)


We consider the original work of Hoare and Jones on data refinement in the light of Dijkstra and Smyth's treatment of nondeterminism and of Milner and Park's definition of the simulation of Communicating Systems. Two proof methods are suggested which we hope are simpler and more general than those in current use. They are proved to be individually sufficient for the correctness of refinement and together necessary for it. The proof methods can be employed to derive the weakest specification of an implementation from its abstract specification.


Data Type Proof Obligation Data Refinement Proof Method Concrete Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. E.W. Dijkstra A Discipline of Programming, Prentice-Hall, Englewood Cliffs, N.J., 1976.Google Scholar
  2. H3MS4 Data Refinement Refined, Draft 1, PRG preprint, May, 1985.Google Scholar
  3. He, Jifeng, C.A.R. Hoare and J.W. Sanders Data Refinement Refined, to appear.Google Scholar
  4. C.A.R. Hoare Proof of correctness of data representations, Acta Informatica, 1, 271–281, 1972.CrossRefGoogle Scholar
  5. C.A.R. Hoare and He, Jifeng The weakest prespecification, Technical Monograph, PRG-44, June, 1985.Google Scholar
  6. C.B. Jones Software Development: A Rigorous Approach, Prentice-Hall International, Englewood Cliffs, N.J., 1980.Google Scholar
  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.Google Scholar
  8. T. Nipkow Nondeterministic data types: models and implementations, University of Manchester preprint, March, 1985.Google Scholar
  9. D. Park Concurrency and automata on infinite sequences, in LNCS, 104, 167–183, 1981.Google Scholar
  10. M.B. Smyth Effectively given domains, TCS, 5, 257–274, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • J. He
    • 1
  • C. A. R. Hoare
    • 1
  • J. W. Sanders
    • 1
  1. 1.Programming Research GroupOxford University Computing LaboratoryOxford

Personalised recommendations