Abstract
This paper presents two examples of implementing shared abstract data types in EDISON and Ada®. The solutions are based on Laventhal's algorythm for implementing synchronization specification. The presented two examples illustrate how shared abstract data types can be implemented using different language constructs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
ADA 82. Reference Manual for the ADA Programming Language United States Department of Defence, 1982.
Brinch Hansen, P.: EDISON — A Multiprocessor Language. Software Practice and Experience, Vol. 11, pp. 325–361, 1981.
Brinch Hansen, P.: The Design of EDISON. Software Practice and Experience, Vol.11, pp. 363–396, 1981.
Brinch Hansen, P.: EDISON Programs. Software Practice and Experience, Vol. 11, pp. 397–414, 1981.
Hoare, C.A.R.: Proof of Correctness of Data Representations. Acta Informatica I, pp. 271–281, 1972.
Kozma, L.: Absztrakt adattipusok specifikációja párhuzamos programozási környezetben. (In Hungarian) Programozási Rendszerek'81 Konferencia, pp. 326–342, 1981.
Laventhal, M.S.: Synthesis of synchronization code for data abstractions. M.I.T. Laboratory for Computer Science, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kozma, L., Laborczi, Z. (1985). On implementation problems of shared abstract data types. In: Knuth, E., Neuhold, E.J. (eds) Specification and Design of Software Systems. OS 1982. Lecture Notes in Computer Science, vol 152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0051565
Download citation
DOI: https://doi.org/10.1007/BFb0051565
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12284-5
Online ISBN: 978-3-540-39605-5
eBook Packages: Springer Book Archive