On implementation problems of shared abstract data types

  • L. Kozma
  • Z. Laborczi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 152)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ADA 82. Reference Manual for the ADA Programming Language United States Department of Defence, 1982.Google Scholar
  2. Brinch Hansen, P.: EDISON — A Multiprocessor Language. Software Practice and Experience, Vol. 11, pp. 325–361, 1981.zbMATHGoogle Scholar
  3. Brinch Hansen, P.: The Design of EDISON. Software Practice and Experience, Vol.11, pp. 363–396, 1981.zbMATHGoogle Scholar
  4. Brinch Hansen, P.: EDISON Programs. Software Practice and Experience, Vol. 11, pp. 397–414, 1981.zbMATHGoogle Scholar
  5. Hoare, C.A.R.: Proof of Correctness of Data Representations. Acta Informatica I, pp. 271–281, 1972.Google Scholar
  6. Kozma, L.: Absztrakt adattipusok specifikációja párhuzamos programozási környezetben. (In Hungarian) Programozási Rendszerek'81 Konferencia, pp. 326–342, 1981.Google Scholar
  7. Laventhal, M.S.: Synthesis of synchronization code for data abstractions. M.I.T. Laboratory for Computer Science, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • L. Kozma
    • 1
  • Z. Laborczi
    • 1
  1. 1.Enterprise for Computer ApplicationsBudapestHungary

Personalised recommendations