Preview
Unable to display preview. Download preview PDF.
References
Broy, M., Wirsing, M., Partial abstract types, Acta Inform. 18 (1982), 47–64
Cartwright, R., A constructive alternative to abstract data type definitions, Proc. 1980 LISP Conf., Stanford Univ. (1980), 46–55
Ehrig, H., Mahr, B., Fundamentals of Algebraic Specification, Springer-Verlag, 1985
Guttag, J.V., Horowitz, E., Musser, D.R., Abstract data types and software validation. Comm. ACM 21 (Dec. 1978), 1048–1069
Goguen, J.A., Meseguer, J., Initiality, Induction and Computability, SRI-CSL Techn. Rep. 140, Stanford Research Institute, December 1983
Goguen, J.A., Thatcher, J.W., Wagner, E.G., An initial algebra approach to the specification, correctness and implementation of abstract data types. Current Trends in Programming Methodology IV (Yeh, R., Ed.), Prentice-Hall, 1978, 80–149
Klaeren, H.A., A constructive method for abstract algebraic software specification, Theor. Comp. Sc. 30, 139–204 (1984)
Lermen, C.W., OBSCURE, a specification language for algorithmic specifications, Intern. Rep., FR 10.2, Univ. Saarbrücken (in preparation)
Liskov, B., et al, CLU Reference Manual, LNCS 114, 1981
Loeckx, J., Proving properties of algorithmic specifications of abstract data types in AFFIRM. AFFIRM-Memo-29-JL, USC-ISI, Marina del Rey, 1980
Loeckx, J., Algorithmic specifications of abstract data types, Proc. ICALP 81, LNCS 115 (1981), 129–147
Loeckx, J., Using abstract data types for the definition of programming languages and the verification of their compilers, Int. Rep. A 81/13, FB 10, Univ. Saarbrücken (1981)
Loeckx, J., Algorithmic specifications: A constructive specification method for abstract data types, to appear in TOPLAS
Loeckx, J., Sieber, K., The Foundations of Program Verification, J. Wiley/Teubner-Verlag, New York/Stuttgart (1984)
Manna, Z., Mathematical Theory of Computation, McGraw-Hill (1974)
Milner, R., Implementation and application of Scott's logic for computable functions. Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7 (Jan. 1972), 1–6
Musser, D.R., Abstract data type specification in the AFFIRM System. IEEE Trans. on Softw. Eng. SE-6 (1980), 24–32
Nakajima, R., Yuasa, T., The IOTA Programming System, LNCS 160, 1983
Reichel, H., Initially-restricting algebraic theories, Proc. 9th FCS, LNCS 88, 460–473 (1980)
Sannella, D., A set-theoretic semantics for CLEAR, Acta Inform. 21, 5, 443–472 (1984)
Shaw, M. (ed.), ALPHARD, Form and Content, Springer-Verlag, 1981
Thompson, D.H. (Ed.), AFFIRM Reference Manual. Internal Report, USC-ISI, Marina del Rey (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loeckx, J. (1986). The algorithmic specification method of abstract data types: An overview. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-16444-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16444-9
Online ISBN: 978-3-540-39784-7
eBook Packages: Springer Book Archive