@inproceedings{b7946f8398834a72814ca2359ddb47da,
title = "Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types?",
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.",
author = "Tobias Nipkow",
note = "Publisher Copyright: {\textcopyright} 1987, Springer-Verlag.; 4th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1987 ; Conference date: 19-02-1987 Through 21-02-1987",
year = "1987",
doi = "10.1007/BFb0039611",
language = "English",
isbn = "9783540172192",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "260--271",
editor = "Guy Vidal-Naquet and Brandenburg, {Franz J.} and Martin Wirsing",
booktitle = "STACS 1987 - 4th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",
}