Coupling schemas: data refinement and view (point) composition

  • Authors:

  • Eerke Boiten;John Derrick;Howard Bowman;Maarten Steen

  • Affiliations:

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

  • Venue:
  • 2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
  • Year:
  • 1997

  • IO-refinement in Z

    3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods

Quantified Score

Hi-index 0.00

Visualization

Abstract

We define the notion of a coupling schema in Z, and describe the role it plays in data refinement, view composition, and viewpoint unification. In each case coupling schemas relate several state schemas. In data refinement they occur as retrieve relations (abstraction schemas). In specification by views, coupling schemas provide a link between the various views. For viewpoint specification, coupling schemas are closely related to correspondence relations between state schemas in the viewpoints. Simple properties of coupling schemas (e.g. totality, functionality, and consistency) are shown to have important consequences in the techniques listed, and to be very useful for exhibiting the relations between these techniques. It turns out that views and viewpoints can both be seen as variations on, or even as generalisations of, data refinement.