The lattice of data refinement

  title={The lattice of data refinement},
  author={Joakim von Wright},
  journal={Acta Informatica},
We define a general notion of data refinement that comprises the traditional notion of data refinement as a special case. Using the concepts of duals and adjoints, we define converse commands and find a symmetry between ordinary data refinement and a dual (backward) data refinement. We show how ordinary and backward data refinement are interpreted as simulation, and we derive rules for the piecewise data refinement of programs. Our results are valid for a general language, including demonic and… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 28 references

Changing data representation in the refinement calculus

  • R.J.R. Back
  • In: 21st Hawaii International Conference on…
  • 1989
Highly Influential
4 Excerpts

CONCUR ' 91 . Proceedings of 2 nd International Conference on Concurrency Theory ( Lect

  • J. C. Baeten, J. F. Groote
  • Notes Comput Sci .
  • 1991

Ofwp and CSP

  • C. C. Morgan, J. Woodcock
  • 1991

A lattice-theoretical basis for program refinement

  • Wright, J. von
  • PhD thesis,
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…