Abstract
A new method for the specification of abstract data types is presented. Being algorithmic it avoids several difficulties of the algebraic specification method.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Aubin, "Mechanizing structural induction, part 1", Theoretical Computer Science 9, 3, pp. 329–345 (1979)
M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing, "Existential quantifiers in abstract data types", Proc. ICALP, Lect. Notes in Comp. Sc. 71, Springer-Verlag, pp. 71–87 (1979)
M. Broy, M. Wirsing, "Partial recursive functions and abstract data types", EATCS Bull. no 11, pp. 34–41 (June 1980)
R. M. Burstall, "Proving properties of programs by structural induction", Comp. J. 12, pp. 41–48 (1969)
R. Cartwright, "A constructive alternative to axiomatic data type definitions", Internal Report TR 80–427, Cornell University, June 1980
H. Ehrig, H. J. Kreowski, P. Padawitz, "Stepwise specification and implementation of abstract data types", Proc. ICALP, Lect. Notes in Comp. Sc. 62, pp. 203–226, Springer-Verlag, 1978
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, Prentice-Hall, 1978
J. A. Goguen, "Abstract errors for abstract data types" in E. J. Neuhold (ed.), "Formal description of programming concepts", North-Holland, 1978
M. Gordon, R. Milner, C. Wadsworth, "Edinburgh LCF", Lecture Notes in Computer Science 78, Springer-Verlag, 1979
J. V. Guttag, J. J. Horning, "The algebraic specifications 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
J. V. Guttag, "Notes on type abstraction", IEEE Trans. on Softw. Eng. SE-6, 1, pp. 13–23 (1980)
D. Kapur, "Specifications of Majster's traversable stack and Veloso's traversable stack", SIGPLAN Notices 14, 5, pp. 46–53 (1979)
H. Klaeren, "A simple class of algorithmic specifications for abstract software modules", Proc. ICALP, Lect. Notes in Comp. Sc. 88, pp. 362–374, Springer-Verlag, 1980
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, "Algorithmic specifications of abstract data types", Internal Report A 80/12, Fachbereich 10, Universität des Saarlandes, Saarbrücken, 1980
J. Loeckx, "Implementations of abstract data types and their correctness proofs", Internal Report A 80/13, Fachbereich 10, Universität des Saarlandes, Saarbrücken, 1980
J. Loeckx, "Algorithmic specifications of some non-trivial data types", Internal Report, Fachbereich 10, Universität des Saarlandes, to appear
M. E. Majster, "Data types, abstract data types and their specification problem", Theor. Comp. Sc. 8, 1, pp. 89–127 (1979)
R. Milner, "Implementation and application of Scott's logic for computable functions", Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7, 1, pp. 1–6 (1972)
R. Milner, "Models of LCF", Stanford University Memo AIM-186, January 1973
A. Moitra, "A note on algebraic specifications of binary trees", SIGPLAN Notices 15, 6, pp. 64–67 (1980)
D. R. Musser, "Abstract data type specification in the AFFIRM System", IEEE Trans. on Softw. Eng. SE-6, 1, pp. 24–32 (1980)
J. E. Stoy, "Denotational semantics: The Scott-Strachey approach to programming language theory", MIT-Press, Cambridge (Mass.) 1977
D. H. Thompson (Ed.), "AFFIRM Reference Manual", Internal Report, USC-ISI, Marina del Rey, 1979
M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy, "On hierarchies of abstract data types", Internal Report TUM-I 8007, Technische Universität München, Mai 1980
S. N. Zilles, "Algebraic specifications of data types", Comp. Struct. Group Memo 119, Lab. for Comp. Sc., MIT, 1974
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loeckx, J. (1981). Algorithmic specifications of abstract data types. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive