The algorithmic specification method of abstract data types: An overview

  • Jacques Loeckx
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 215)


Operation Symbol Abstract Data Type Recursive Program Algebraic Specification Constructive Nature 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BW 82]
    Broy, M., Wirsing, M., Partial abstract types, Acta Inform. 18 (1982), 47–64Google Scholar
  2. [Ca 80]
    Cartwright, R., A constructive alternative to abstract data type definitions, Proc. 1980 LISP Conf., Stanford Univ. (1980), 46–55Google Scholar
  3. [EM 85]
    Ehrig, H., Mahr, B., Fundamentals of Algebraic Specification, Springer-Verlag, 1985Google Scholar
  4. [GHM 78]
    Guttag, J.V., Horowitz, E., Musser, D.R., Abstract data types and software validation. Comm. ACM 21 (Dec. 1978), 1048–1069Google Scholar
  5. [GM 83]
    Goguen, J.A., Meseguer, J., Initiality, Induction and Computability, SRI-CSL Techn. Rep. 140, Stanford Research Institute, December 1983Google Scholar
  6. [GTW 78]
    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–149Google Scholar
  7. [Kl 84]
    Klaeren, H.A., A constructive method for abstract algebraic software specification, Theor. Comp. Sc. 30, 139–204 (1984)Google Scholar
  8. [Le 85]
    Lermen, C.W., OBSCURE, a specification language for algorithmic specifications, Intern. Rep., FR 10.2, Univ. Saarbrücken (in preparation)Google Scholar
  9. [Li 81]
    Liskov, B., et al, CLU Reference Manual, LNCS 114, 1981Google Scholar
  10. [Lo 80]
    Loeckx, J., Proving properties of algorithmic specifications of abstract data types in AFFIRM. AFFIRM-Memo-29-JL, USC-ISI, Marina del Rey, 1980Google Scholar
  11. [Lo 81 a]
    Loeckx, J., Algorithmic specifications of abstract data types, Proc. ICALP 81, LNCS 115 (1981), 129–147Google Scholar
  12. [Lo 81 b]
    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)Google Scholar
  13. [Lo 84]
    Loeckx, J., Algorithmic specifications: A constructive specification method for abstract data types, to appear in TOPLAS Google Scholar
  14. [LS 84]
    Loeckx, J., Sieber, K., The Foundations of Program Verification, J. Wiley/Teubner-Verlag, New York/Stuttgart (1984)Google Scholar
  15. [Ma 74]
    Manna, Z., Mathematical Theory of Computation, McGraw-Hill (1974)Google Scholar
  16. [Mi 72]
    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–6Google Scholar
  17. [Mu 80]
    Musser, D.R., Abstract data type specification in the AFFIRM System. IEEE Trans. on Softw. Eng. SE-6 (1980), 24–32Google Scholar
  18. [NY 83]
    Nakajima, R., Yuasa, T., The IOTA Programming System, LNCS 160, 1983Google Scholar
  19. [Re 80]
    Reichel, H., Initially-restricting algebraic theories, Proc. 9th FCS, LNCS 88, 460–473 (1980)Google Scholar
  20. [Sa 84]
    Sannella, D., A set-theoretic semantics for CLEAR, Acta Inform. 21, 5, 443–472 (1984)Google Scholar
  21. [Sh 81]
    Shaw, M. (ed.), ALPHARD, Form and Content, Springer-Verlag, 1981Google Scholar
  22. [Th 79]
    Thompson, D.H. (Ed.), AFFIRM Reference Manual. Internal Report, USC-ISI, Marina del Rey (1979)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jacques Loeckx
    • 1
  1. 1.Fachrichtung 10.2 InformatikUniversität des SaarlandesSaarbrücken

Personalised recommendations