IO-refinement in Z

  • Authors:
  • Eerke Boiten;John Derrick

  • Affiliations:
  • Computing Laboratory, University of Kent, Canterbury, Kent, UK;Computing Laboratory, University of Kent, Canterbury, Kent, UK

  • Venue:
  • 3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a generalisation of data refinement in Z, called IO-refinement, that allows changes in input and output parameters of operations. Several informal motivations for the desirability of such a refinement relation are given, followed by a formal derivation that demonstrates its theoretical soundness. It is proved that IO-refinement indeed generalizes data refinement. Several theorems are presented that give sufficient conditions for IO-refinement to hold in simpler situations, e.g. just adding inputs and outputs. Some examples of the use of IO-refinement are also given.