Skip to main content

Bounded implementation of algebraic specifications

  • Contributed Papers
  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1991, COMPASS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 655))

Abstract

A specification and implementation method is proposed which tackles the problem of transition from infinite abstract data types to the finite structures of a physical machine. This is achieved by specifying the idealized properties of a data type and its bounds separately. An implementation has to realize the structure of the data type inside the specified bounds only.

This work is based on my PhD-thesis, carried out at the Universilät Passau and the Technische Universität München

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. A. Goguen, J. W. Thatcher, E. G. Wagner, An initial algebra approach to the specification, correctness and implementation of abstract data types, in: R. T. Yeh (ed.): Current trends in programming methodology, Vol. 4, Data structuring, pp. 80–149 (Prentice-Hall, Englewood Cliffs, 1978)

    Google Scholar 

  2. F. L. Bauer: Programming as fulfilment of a contract, in: P. Henderson (ed.): System design, Infotech: State of the Art Report 9:6, pp. 165–174 (Pergamon Infotech Ltd., Maidenhead, 1981)

    Google Scholar 

  3. M. Breu: Development of implementations, in: PROgram Development by SPECification and TRAnsformation, Volume I, PROSPECTRA — Esprit Project Number 390, Report M2.2.S4 — R — 11.0, 1990 (to appear in LNCS)

    Google Scholar 

  4. M. Breu: Endliche Implementierung algebraischer Spezifikationen, Ph.D. Thesis (in German), technical report TUM 19111, Institut für Informatik, TU München, (1991)

    Google Scholar 

  5. M. Broy, M. Wirsing: Partial abstract types, Acta Informatica 18, pp. 47–64(1982)

    Article  Google Scholar 

  6. G. Bcrnot, M. Bidoit, C. Choppy: Abstract data types with exception handling: An initial approach based on a distinction between exceptions and errors, Theoretical Computer Science 46, p. 13–45 (1986)

    Google Scholar 

  7. M. Bidoit, M.-C. Gaudel, A. Mauboussin: How to make algebraic specifications more understandable?, in: M. Wirsing, J.A. Bergstra (eds.): Algebraic methods: Theory, Tools and Applications, LNCS 394 (Springer, Berlin, 1989)

    Google Scholar 

  8. H. Ehrig, H.-J. Kreowski, B. Mahr, P. Padawitz: Algebraic implementation of abstract data types, Theoretical Computer Science 20, pp. 209–263 (1982)

    Google Scholar 

  9. H. Ehrig, B. Mahr: Fundamentals of Algebraic Specification 2, EATCS Monographs on Theoretical Computer Science 21 (Springer, Berlin, 1990)

    Google Scholar 

  10. J. A. Goguen: Abstract errors for abstract data types, In: E. Neuhold (ed.): Formal description of programming concepts (North Holland, Amsterdam, 1977)

    Google Scholar 

  11. R. Hennicker, Beobachtungsorientierte Spezifikationen, Dissertation, Universität Passau (1988) (shortened version in: R. Hennicker: Observational Implementations, in: B. Monien, R. Cori (eds.): Proc. STACS 89, LNCS 349, 1989, pp. 59–71)

    Google Scholar 

  12. C. A. R. Hoare: Proofs of correctness of data representations, Acta Informatica 1, 1972, pp. 271–281 (1972)

    Article  Google Scholar 

  13. H. Hußmann: Rapid prototyping for algebraic specifications — RAP system user's manual, technischer Report MIP-8504 (Universität Passau, Passau, 1985, 2. second extended edition 1987)

    Google Scholar 

  14. S. Kamin, M. Archer, Partial implementation of abstract data types: a dissenting view on errors, In: L. G. Kuhn, D.B. MacQueen, G. Plotkin (eds.): Semantics of data types, International Symposium ... 1984, LNCS 173, pp. 317–336 (Springer, Berlin, 1984)

    Google Scholar 

  15. P. le Gall, G. Bernot: Label algebras and exception handling, 8th Workshop on Specification of Abstract Data Types, Dourdan (1991)

    Google Scholar 

  16. J. Loeckx: The specification system OBSCURE, Bull. EATCS 40, pp. 169–171 (1990)

    Google Scholar 

  17. T. Nipkow: Observing nondeterministic data types, in: D.T. Sannella, A. Tarlecki (eds.): Recent Trends in Data Type Specifications, LNCS 332 (Springer, Bln, 1989)

    Google Scholar 

  18. D. T. Sannclla, M. Wirsing: Implementation of paramelerised specifications. Internal Report CSR-103-82, Department of Computer Science, University of Edinburgh (1982) (Extended Abstract in: Proc. 1CALP 82, 9th Int. coll. on automata, languages and programming, Aarhus, Denmark, LNCS 140, S. 473–488(1982))

    Google Scholar 

  19. O. Schoett, Data abstraction and the correctness of modular programming, Ph. D. Thesis, University of Edinburgh (1987)

    Google Scholar 

  20. G. Smolka, W. Nutt, J. A. Goguen, J. Meseguer: Order-Sorted Equational Computation. SEKI-Report SR-87-14, Universität Kaiserslautern, Fachbereich Informatik, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michel Bidoit Christine Choppy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Breu, M. (1993). Bounded implementation of algebraic specifications. In: Bidoit, M., Choppy, C. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1991 1991. Lecture Notes in Computer Science, vol 655. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56379-2_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-56379-2_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56379-2

  • Online ISBN: 978-3-540-47545-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics