Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
5 References
M. Broy: Extensional Behaviour of Concurrent, Nondeterministic Communicating Systems, in: Control Flow and Data Flow: Concepts of Distributed Programming (M. Broy, ed.), Springer Verlag, 1985
M. Broy, M. Wirsing: Partial Abstract Types, Acta Informatica 18, 1, 1982
M. Broy, J.C. Pair, M. Wirsing: A Systematic Study of Models of Abstract Data Types, Theoretical Computer Science, 1984
P. Burmeister: A Model Theoretic Oriented Approach to Partial Algebras, Akademie-Verlag Berlin, 1986
I. Castellani: Bisimulations and Abstraction Homomorphisms, in: Proc. CAAP'85, LNCS 185, 1985
H. Ehrig, H.-J. Kreowski: Parameter Passing Commutes with Implementation of Parametrized Data Types, in Proc. ICALP'82, LNCS 140, 1982
V. Giarratana, F. Gimona, U. Montanari: Observability Concepts in Abstract Data Types, in: Proc. MFCS'76, LNCS 45, 1976
G. Hansoul: Systemes Relationelles Et Algebres Multiformes, Ph.D. Thesis, Universite de Liege, 1980
C.A.R. Hoare: Proof of Correctness of Data Representation, Acta Informatica 1, 1972
C.B. Jones: Software Development: A Rigorous Approach, Prentice/Hall International, 1980
S. Kamin, M. Archer: Partial Implementations of Abstract Data Types: A Dissenting View on Errors, in: Semantics of Data Types, LNCS 173, 1984
R. Milner: Fully Abstract Models of Typed λ-Calculi, Theoretical Computer Science 4, 1977
T. Nipkow: Nondeterministic Data Types: Models and Implementations, Acta Informatica 22, 1986
T. Nipkow: Behavioural Implementations of Nondeterministic Data Types, Ph.D. Thesis, University of Manchester, forthcoming
H. Reichel: Initial Restrictions of Behaviour, in: The Role of Abstract Models in Information Processing, (E.J. Neuhold, G. Chroust, eds.), North-Holland, 1985
O. Schoett: Behavioural Correctness of Data Representations, University of Edinburgh, Dept. of Computer Science, Internal Report CSR-185-85, 1985
J. Vuillemin: Correct and Optimal Implementation of Recursion in a Simple Programming Language, in: Proc. 5th ACM Symposium on Theory of Computing, 1973
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, 1976
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nipkow, T. (1987). Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types?. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039611
Download citation
DOI: https://doi.org/10.1007/BFb0039611
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17219-2
Online ISBN: 978-3-540-47419-7
eBook Packages: Springer Book Archive