Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types?

  • Tobias Nipkow
Contributed Papers Abstract Data Types
Part of the Lecture Notes in Computer Science book series (LNCS, volume 247)


For deterministic data types it has been shown that total and robust correctness admit fully abstract models and partial correctness does not. For nondeterministic data types only bisimulation equivalence gives rise to fully abstract models, total, loose, robust, and partial correctness do not. In the cases where fully abstract models do not exist, it is in general necessary to use simulations instead of homomorphisms for proof of correctness of data type implementations.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5 References

  1. [B 85]
    M. Broy: Extensional Behaviour of Concurrent, Nondeterministic Communicating Systems, in: Control Flow and Data Flow: Concepts of Distributed Programming (M. Broy, ed.), Springer Verlag, 1985Google Scholar
  2. [BW 82]
    M. Broy, M. Wirsing: Partial Abstract Types, Acta Informatica 18, 1, 1982Google Scholar
  3. [BPW 84]
    M. Broy, J.C. Pair, M. Wirsing: A Systematic Study of Models of Abstract Data Types, Theoretical Computer Science, 1984Google Scholar
  4. [Bu 86]
    P. Burmeister: A Model Theoretic Oriented Approach to Partial Algebras, Akademie-Verlag Berlin, 1986Google Scholar
  5. [C 85]
    I. Castellani: Bisimulations and Abstraction Homomorphisms, in: Proc. CAAP'85, LNCS 185, 1985Google Scholar
  6. [EK 82]
    H. Ehrig, H.-J. Kreowski: Parameter Passing Commutes with Implementation of Parametrized Data Types, in Proc. ICALP'82, LNCS 140, 1982Google Scholar
  7. [GGM 76]
    V. Giarratana, F. Gimona, U. Montanari: Observability Concepts in Abstract Data Types, in: Proc. MFCS'76, LNCS 45, 1976Google Scholar
  8. [Ha 80]
    G. Hansoul: Systemes Relationelles Et Algebres Multiformes, Ph.D. Thesis, Universite de Liege, 1980Google Scholar
  9. [H 72]
    C.A.R. Hoare: Proof of Correctness of Data Representation, Acta Informatica 1, 1972Google Scholar
  10. [J 80]
    C.B. Jones: Software Development: A Rigorous Approach, Prentice/Hall International, 1980Google Scholar
  11. [KA 84]
    S. Kamin, M. Archer: Partial Implementations of Abstract Data Types: A Dissenting View on Errors, in: Semantics of Data Types, LNCS 173, 1984Google Scholar
  12. [M 77]
    R. Milner: Fully Abstract Models of Typed λ-Calculi, Theoretical Computer Science 4, 1977Google Scholar
  13. [N 86]
    T. Nipkow: Nondeterministic Data Types: Models and Implementations, Acta Informatica 22, 1986Google Scholar
  14. [N 87]
    T. Nipkow: Behavioural Implementations of Nondeterministic Data Types, Ph.D. Thesis, University of Manchester, forthcomingGoogle Scholar
  15. [R 85]
    H. Reichel: Initial Restrictions of Behaviour, in: The Role of Abstract Models in Information Processing, (E.J. Neuhold, G. Chroust, eds.), North-Holland, 1985Google Scholar
  16. [S 85]
    O. Schoett: Behavioural Correctness of Data Representations, University of Edinburgh, Dept. of Computer Science, Internal Report CSR-185-85, 1985Google Scholar
  17. [V 73]
    J. Vuillemin: Correct and Optimal Implementation of Recursion in a Simple Programming Language, in: Proc. 5th ACM Symposium on Theory of Computing, 1973Google Scholar
  18. [WLS 76]
    W.A. Wulf, R.L. London, M. Shaw: An Introduction to the Construction and Verification of Alphard Programs, IEEE Trans. on Software Engineering 2, 4, 1976Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Tobias Nipkow
    • 1
  1. 1.Department of Computer ScienceThe University of ManchesterUK

Personalised recommendations