Advertisement

Algorithmic specifications of abstract data types

  • Jacques Loeckx
Session 4: C. Boehm, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)

Abstract

A new method for the specification of abstract data types is presented. Being algorithmic it avoids several difficulties of the algebraic specification method.

Keywords

Data Type Algorithmic Specification Structural Induction Abstract Data Type External Function 
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

  1. [Au 79]
    R. Aubin, "Mechanizing structural induction, part 1", Theoretical Computer Science 9, 3, pp. 329–345 (1979)Google Scholar
  2. [BDP 79]
    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)Google Scholar
  3. [BM 80]
    M. Broy, M. Wirsing, "Partial recursive functions and abstract data types", EATCS Bull. no 11, pp. 34–41 (June 1980)Google Scholar
  4. [Bu 69]
    R. M. Burstall, "Proving properties of programs by structural induction", Comp. J. 12, pp. 41–48 (1969)Google Scholar
  5. [Ca 80]
    R. Cartwright, "A constructive alternative to axiomatic data type definitions", Internal Report TR 80–427, Cornell University, June 1980Google Scholar
  6. [EKP 78]
    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, 1978Google Scholar
  7. [ADJ 78]
    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, 1978Google Scholar
  8. [Go 78]
    J. A. Goguen, "Abstract errors for abstract data types" in E. J. Neuhold (ed.), "Formal description of programming concepts", North-Holland, 1978Google Scholar
  9. [GMW 79]
    M. Gordon, R. Milner, C. Wadsworth, "Edinburgh LCF", Lecture Notes in Computer Science 78, Springer-Verlag, 1979Google Scholar
  10. [GH 78 a]
    J. V. Guttag, J. J. Horning, "The algebraic specifications of abstract data types", Acta Informatica 10, 1, pp. 27–52 (1978)Google Scholar
  11. [GHM 78 b]
    J. V. Guttag, E. Horowitz, D. R. Musser, "Abstract data types and software validation", Comm. ACM 21, 12, pp. 1048–1064Google Scholar
  12. [Gu 80]
    J. V. Guttag, "Notes on type abstraction", IEEE Trans. on Softw. Eng. SE-6, 1, pp. 13–23 (1980)Google Scholar
  13. [Ka 79]
    D. Kapur, "Specifications of Majster's traversable stack and Veloso's traversable stack", SIGPLAN Notices 14, 5, pp. 46–53 (1979)Google Scholar
  14. [Kl 80]
    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, 1980Google Scholar
  15. [Lo 80 a]
    J. Loeckx, "Proving properties of algorithmic specifications of abstract data types in AFFIRM", AFFIRM-Memo-29-JL, USC-ISI, Marina del Rey, 1980Google Scholar
  16. [Lo 80 b]
    J. Loeckx, "Algorithmic specifications of abstract data types", Internal Report A 80/12, Fachbereich 10, Universität des Saarlandes, Saarbrücken, 1980Google Scholar
  17. [Lo 80 c]
    J. Loeckx, "Implementations of abstract data types and their correctness proofs", Internal Report A 80/13, Fachbereich 10, Universität des Saarlandes, Saarbrücken, 1980Google Scholar
  18. [Lo 81]
    J. Loeckx, "Algorithmic specifications of some non-trivial data types", Internal Report, Fachbereich 10, Universität des Saarlandes, to appearGoogle Scholar
  19. [Mj 79]
    M. E. Majster, "Data types, abstract data types and their specification problem", Theor. Comp. Sc. 8, 1, pp. 89–127 (1979)Google Scholar
  20. [Mi 72]
    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)Google Scholar
  21. [Mi 73]
    R. Milner, "Models of LCF", Stanford University Memo AIM-186, January 1973Google Scholar
  22. [Mo 80]
    A. Moitra, "A note on algebraic specifications of binary trees", SIGPLAN Notices 15, 6, pp. 64–67 (1980)Google Scholar
  23. [Mu 80]
    D. R. Musser, "Abstract data type specification in the AFFIRM System", IEEE Trans. on Softw. Eng. SE-6, 1, pp. 24–32 (1980)Google Scholar
  24. [St 77]
    J. E. Stoy, "Denotational semantics: The Scott-Strachey approach to programming language theory", MIT-Press, Cambridge (Mass.) 1977Google Scholar
  25. [Th 79]
    D. H. Thompson (Ed.), "AFFIRM Reference Manual", Internal Report, USC-ISI, Marina del Rey, 1979Google Scholar
  26. [WPP 80]
    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 1980Google Scholar
  27. [Zi 74]
    S. N. Zilles, "Algebraic specifications of data types", Comp. Struct. Group Memo 119, Lab. for Comp. Sc., MIT, 1974Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Jacques Loeckx
    • 1
  1. 1.Fachbereich 10Universität des SaarlandesSaarbrücken

Personalised recommendations