Zusammenfassung
Algorithmic specifications of abstract data types have been introduced in [Lo 81a]. While being strongly related to the algebraic specification method used by e. g. [GH 78a, GHM 78b, Mu 80] the algorithmic specification method avoids several of its problems; it provides for instance an elegant way for handling undefined and error values; moreover it is felt to be easier to use for the specification of non-trivial data types.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. A. Goguen, J. W. Thatcher, E. G. Wagner, “An initial algebra approach to the specification, correctness and implementation of abstract data types” in “Current Trends in Programming Methodology IV” (R. Yeh, ed.), pp. 80–149, Pentice Hall, 1978
H. Ehrig, H. J. Kreowski, P. Padawitz, “Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness”, Lecture Notes in Computer Science 85, Springer-Verlag, 1980, pp. 142–156
M. C. Gaudel, “Algebraic specification of abstract data types”, Internal Report 360, IRIA, Le Chesney (August 1979)
J.V. Guttag, J. J. Horning, “The algebraic specification of abstract data types”,, Acta Informatica 10, 1, pp. 27–52 (1978)
J. V. Guttag, E. Horowitz, D. R. Musser, “Abstract data types and software validation”, Comm. ACM 21, 12, pp. 1048–1064 (1978)
C. A. R. Hoare,”Proof of correctness of data representations”, Acta Informatica 1, 4, pp. 271–281 (1972)
J. Loeckx, “Proving properties of algorithmic specifications of abstract data types in AFFIRM”, AFFIRM-Memo-29-JL, USC-ISI, Marina del Rey, 1980
J. Loeckx, “Some properties of implementations of abstract data types”, Internal Report A 80/14, Fachbereich 10, Universität des Saarlandes, Saarbrücken, 1980
J. Loeckx, “Algorithmic specifications of abstract data types”, Proc. ICALP 81 (Haifa), to be published as Springer Lect. Notes (1981)
J. Loeckx, “The description of programming languages and the verification of their compilers by abstract data types”, Internal Report, Fachbereich 10, Universität des Saarlandes, Saarbrücken (in preparation)
R. Milner, “Implementation and applications of Scott’s logic for computable functions”, Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7, 1, pp. 1–6 (1972)
D. R. Musser, “Abstract data type specification in the AFFIRM-system”, IEEE Trans. on Softw. Eng., SE-6, 1, pp. 24–32 (1980)
P. A. Subrahmanyam, “On proving the correctness of data type implementations”, Internal report, Dept. Comp. Sc., University of Utah, Sept. 1979
M. Shaw, W. A. Wulf, R. L. London, “Abstraction and verification in ALPHARD: Defining and specifying iteration and generators”, CACM 20, 8, pp.553–564 (1977)
W. A. Wulf, M. Shaw, P. N. Hilfinger, L. Flon, “Fundamental structures of Computer Science”, Addison-Wesley Publ. Co., 1981 (Chapter 11)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Loeckx, J. (1981). Implementations of abstract data types and their verification. In: Brauer, W. (eds) GI — 11. Jahrestagung. Informatik-Fachberichte, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01089-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-01089-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10884-9
Online ISBN: 978-3-662-01089-1
eBook Packages: Springer Book Archive