Advertisement

Data reification without explicit abstraction functions

  • T Clement
Session 3b: VDM
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1051)

Abstract

Data reification normally involves the explicit positing of an abstraction function with certain properties. However, the condition for one definition to reify another only requires that a function with such properties should exist. This suggests that it may be possible to carry through a data reification without giving an explicit definition of the abstraction function at all. This paper explores this possibility and compares it with the more conventional approach.

Keywords

Unification Algorithm Initial Object Quotient Algebra Partial Algebra Abstract Type 
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. M. A. Arbib and E. G. Manes. Arrows, Structures, and Functors: The Categorical Imperative. Academic Press, 1975.Google Scholar
  2. R. S. Boyer and J. S. Moore. The sharing of structure in theorem-proving programs. In Machine Intelligence 7, pages 101–116. Edinburgh University Press, 1972.Google Scholar
  3. M. Broy. Extensional behaviour of concurrent, nondeterministic, communicating systems. In Control Flow and Data Flow: Concepts of Distributed Programming, pages 229–276. Springer-Verlag, 1985.Google Scholar
  4. M. Broy and M. Wirsing. Partial abstract types. Acta Informatica, 18:47–64, 1982.Google Scholar
  5. T. Clement. Combining transformation and posit-and-prove in a VDM development. In VDM'91: Formal Software Development Methods, pages 63–92. Springer Verlag, 1991.Google Scholar
  6. T. Clement. Notes on data reification. In FME'93 tutorial material, pages 151–190, 1993.Google Scholar
  7. T. Clement. Comparing approaches to data reification. In FME'94-' Industrial Benefits of Formal Methods (LNCS 873), pages 118–133. Springer Verlag, 1994.Google Scholar
  8. J. Darlington. The design of efficient data representations. In Automatic Program Construction Techniques, chapter 7, pages 139–156. Macmillan, 1984.Google Scholar
  9. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification, volume 6 of EATCS Monographs. Springer-Verlag, 1985.Google Scholar
  10. J. A. Goguen and R. M. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the ACM, pages 95–146, 1992.Google Scholar
  11. J. A. Goguen, J. W. Thatcher, and E. G. Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Current Trends in Programming Methodology, volume 4, 1978. International Standards Organisation. Information Technology Programming Languages Google Scholar
  12. VDM-SL First Committee Draft Standard CD 13817-1, November 1993. Document Number ISO/IEC JTC1/SC22/WG19/N-20.Google Scholar
  13. C. B. Jones. Systematic Software Development Using VDM. Prentice-Hall International, 2nd edition, 1990.Google Scholar
  14. C. C. Morgan and P. H. B. Gardiner. Data refinement by calculation. Acta Informatica, 27:481–503, 1990.Google Scholar
  15. Z. Manna and R. Waldinger. Deductive synthesis of the unification algorithm. Science of Computer Programming, 1:5–48, 1981.Google Scholar
  16. J. N. Oliveira. Software reification using the SETS calculus. In Proceedings of the 5th Refinement Workshop, Workshops in Computing, pages 140–171. Springer-Verlag, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • T Clement
    • 1
  1. 1.AdelardLondonUK

Personalised recommendations