Embedding a Demonic Semilattice in a Relational Algebra

@article{Desharnais1995EmbeddingAD,
  title={Embedding a Demonic Semilattice in a Relational Algebra},
  author={Jules Desharnais and Nadir Belkhiter and Salah Ben Mohamed Sghaier and Fairouz Tchier and Ali Jaoua and Ali Mili and Nejib Zaguia},
  journal={Theor. Comput. Sci.},
  year={1995},
  volume={149},
  pages={333-360}
}
We present a refinement ordering between binary relations, viewed as programs or specifications. This ordering induces a complete join semilattice that can be embedded in a relation algebra. This embedding then allows an easy proof of many properties of the refinement semilattice, by making use of the well-known corresponding properties of relation algebras. The operations of the refinement semilattice corresponding to join and composition in the embedding algebra are, respectively, demonic… CONTINUE READING

References

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

Striihlein, Relations and Graphs, translation

  • T. G. Schmidt
  • 1993

A relational theory of datatypes

  • R. C. Backhouse, P. Hoogendijk, E. Voermans, J. van der Woude
  • Eindhoven University of Technology, Department of…
  • 1992

Relational specification of data types and programs, Technical report 9109

  • R. Berghammer
  • Fakultiit fiir Informatik, Universitat der…
  • 1991

A relational theory of datatypes, in: Workshop on Constructive Algorithmics: The Role of Relations in Program Development, Hollum - Ameland

  • R. C. Backhouse, P. J. de Bruin, G. Malcolm, E. Voermans, J. van der Woude
  • The Netherlands,
  • 1990

Similar Papers

Loading similar papers…