Relations as abstract datatypes: An institution to specify relations between algebras

  • Hubert Baumeister
FASE Fase-7: Specifications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 915)


One way to view the execution state of an imperative program is as a many sorted algebra. Program variables are (constant) functions and their types are sorts. The execution of a program defines a relation between the state of the program (algebra) before and after the execution of the program. In this paper we shall define an institution for the specification of relations between structures of some base institution (eg. the institution of equational logic or first order predicate logic). Sets of structures over a common signature, abstract datatypes, in this institution denote relations between structures of the base institution. This makes it possible to apply a rich repertoire of existing techniques for specifying abstract datatypes to the specification of relations. This paper tries to narrow the gap between algebraic specification languages like Clear, ASL or Act-One and model theoretic based specification languages like Z, VDM-SL or the Larch Interface language.


  1. 1.
    Egidio Astesiano and Elena Zucca. D-oids: A model for dynamic data-types. Mathematical Structures in Computer Science, 1994. to appear.Google Scholar
  2. 2.
    Hubert Baumeister. Unifying initial and loose semantics of parameterized specifications in an arbitrary institution. In Proceedings Tapsoft/CAAP, Brighton, UK, number 493 in LNCS, pages 103–120. Springer, April 1991.Google Scholar
  3. 3.
    R. M. Burstall and J. A. Goguen. The semantics of Clear, a specification language, February 1980.Google Scholar
  4. 4.
    P. Dauchy and M.-C. Gaudel. Algebraic specifications with implicit state, February 1994.Google Scholar
  5. 5.
    R. Diaconescu, J. Goguen, and P. Stefaneas. Logical support for modularisation. Programming Research Group, Oxford University, August 1991.Google Scholar
  6. 6.
    H. Ehrig, P. Pepper, and F. Orejas. On recent trends in algebraic specification. In Proceedings ICALP, Stresa, Italy, number 372 in LNCS, pages 263–288. Springer, July 1989.Google Scholar
  7. 7.
    Hartmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1: Equations and initial Semantics. Number 6 in EATCS Monographs on Theoretical Computer Science. Springer, 1985.Google Scholar
  8. 8.
    Hartmut Ehrig and Fernando Orejas. Dynamic abstract data types, an informal proposal. Bulletin of the EATCS, (53):162–169, June 1994.Google Scholar
  9. 9.
    Harald Ganzinger. Programs as transformations of algebraic theories (extended abstract). Informatik Fachberichte, 50:22–41, 1981.Google Scholar
  10. 10.
    J. A. Goguen and R. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39(1):95–146, January 1992.Google Scholar
  11. 11.
    Yuri Gurevich. Evolving algebras: An attempt to discover semantics. Bulletin ofthe EATCS, (43):264–284, February 1991.Google Scholar
  12. 12.
    J. V. Guttag, J. J. Horning, and J. M. Wing. Larch in five easy pieces. Report 5, DEC Systems Research Center, July 1985.Google Scholar
  13. 13.
    Cliff B. Jones. Systematic Software Development Using VDM. International series in computer science. Prentice Hall, New York, 2sd edition, 1990.Google Scholar
  14. 14.
    Saunders Mac Lane. Categories for the working mathematician. Graduated Texts in Mathematics. Springer, 4th edition, 1988.Google Scholar
  15. 15.
    Donald Sannella and Andrzej Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76(2/3):165–210, February/March 1988.CrossRefGoogle Scholar
  16. 16.
    Donald Sannella and Martin Wirsing. A kernel language for algebraic specification. Internal Report CSR-131-83, University of Edinburgh, September 1983.Google Scholar
  17. 17.
    J. Michael Spivey. The Z Notation: A Reference Manual. International series in computer science. Prentice Hall, New York, 2nd edition, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Hubert Baumeister
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations