z-logo
open-access-imgOpen Access
Coupling Schemas: Data Refinement and View(point) Composition
Author(s) -
Eerke Boiten,
John Derrick,
Howard Bowman,
Maarten Steen
Publication year - 1997
Publication title -
electronic workshops in computing
Language(s) - English
Resource type - Conference proceedings
ISSN - 1477-9358
DOI - 10.14236/ewic/fa1997.2
Subject(s) - computer science , schema (genetic algorithms) , unification , viewpoints , theoretical computer science , abstraction , consistency (knowledge bases) , programming language , information retrieval , artificial intelligence , epistemology , visual arts , art , philosophy
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom