Universal realization, persistent interconnection and implementation of abstract modules

  • J. Goguen
  • J. Meseguer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Benabou, J. “Structures Algebriques dans les Categories.” Cahiers de Topologie et Geometrie Differentiel 10 (1968), 1–126.Google Scholar
  2. 2.
    Burstall, R. M. and Goguen, J. A. “Putting Theories together to Make Specifications.” Proceedings, Fifth International Joint Conference on Artificial Intelligence 5 (1977), 1045–1058.Google Scholar
  3. 3.
    Burstall, R. M., and Goguen, J. A. The Semantics of CLEAR, a Specification Language. In Proceedings of the 1979 Copenhagen Winter School on Abstract Software Specification, Springer-Verlag, 1980, pp. 292–332.Google Scholar
  4. 4.
    Burstall, R. M. and Goguen, J. A. An Informal Introduction to Specifications using CLEAR. In The Correctness Problem in Computer Science, Boyer, R. and Moore, J, Ed.,Academic Press, 1981, pp. 185–213.Google Scholar
  5. 5.
    Dijkstra, E. W. Notes on Structured Programming. In Structured Programming, Hoare, C. A. R., Ed.,Academic Press, 1972.Google Scholar
  6. 6.
    Enrich, H. On Realization and Implementation. In Proceedings, 1981 Conference on Mathematical Foundations of Computer Science, Springer-Verlag, 1981.Google Scholar
  7. 7.
    Ehrig, H., Kreowski, H.-J., Thatcher, J., Wagner, E.G., and Wright, J. Parameter Passing in Algebraic Specification Languages. In Proceedings, 1980 ICALP, Springer-Verlag, 1980.Google Scholar
  8. 8.
    Ehrig, H. Algebraic Theory of Parameterized Specifications with Requirements. In Trees in Algebra and Programming, Springer-Verlag, 1981.Google Scholar
  9. 9.
    Eilenberg, S. and Wright, J. B. “Automata in General Algebras.” Information and Control 11 (1967), 452–470.Google Scholar
  10. 10.
    Ganzinger, H. Parameteric Specifications, Parameter Passing and Optimizing Implementations. Tech. Rept TUM-18110, Technical University of Munich, 1981.Google Scholar
  11. 11.
    Giarrantana, V., Gimona, F. and Montanari, U. Observability Concepts in Abstract Data Specifications. In Proceedings, Conference on Mathematical Foundations of Computer Science, Springer-Verlag, 1976.Google Scholar
  12. 12.
    Goguen, J. A., and Burstall, R. M. CAT, a System for the Structured Elaboration of Correct Programs from Structured Specifications. SRI, International; Computer Science Lab, 1980.Google Scholar
  13. 13.
    Goguen, J. A. and Meseguer, J. “Completeness of Many-sorted Equational Logic.” SIGPLAN Notices 17, 1 (1982), 9–17. Extended version to appear as SRI Technical Report.Google Scholar
  14. 14.
    Goguen, J. A., Thatcher, J. W. and Wagner, E. An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types. In Current Trends in Programming Methodology, R. Yeh, Ed.,Prentice-Hall, 1978.Google Scholar
  15. 15.
    Goguen, J. Mathematical Foundations of Hierarchically Organized Systems. In E. Attinger, Ed., Global Systems Dynamics, S. Karger, 1971, pp. 112–28.Google Scholar
  16. 16.
    Goguen, J. A. “Realization is Universal.” Mathematical System Theory 6 (1973), 359–374.Google Scholar
  17. 17.
    Gratzer, G. Universal Algebra. Springer-Verlag, 1979.Google Scholar
  18. 18.
    Guttag, J. V., Horning, J. J. “The Algebraic Specification of Abstract Data Types.” Acta Informatica 10 (1978), 27–52.Google Scholar
  19. 19.
    Guttag, J. V. The Specification and Application to Programming of Abstract Data Types. Ph.D. Th., University of Toronto, 1975. Computer Science Department, Report CSRG-59.Google Scholar
  20. 20.
    Hoare, C. A. R. “Proof of Correctness of Data Representation.” Acta Informatica 1 (1972), 271–281.Google Scholar
  21. 21.
    Hornung, G. and Raulefs, P. Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specificatons with Inequalities. In Trees in Algebra and Programming, Springer-Verlag, 1981.Google Scholar
  22. 22.
    Hupbach, U. L. Abstract Implementation of Abstract Data Types. In MFCS '80, Springer-Verlag, 1980, pp. 291–304.Google Scholar
  23. 23.
    Kamin, S. Final Data Type Specifications: A New Data Type Specification Mehtod. In Proceedings, 7th POPL, ACM, 1980, pp. 131–138.Google Scholar
  24. 24.
    Lawvere, F. W. “Functorial Semantics of Algebraic Theories.” Proceedings, National Academy of Sciences 50 (1963). Summary of Ph.D. Thesis, Columbia University.Google Scholar
  25. 25.
    Levitt, K., Robinson, L. and Silverberg, B. The HDM Handbook. SRI, International, Computer Science Lab, 1979. Volumes I, II, III.Google Scholar
  26. 26.
    Milner, R. An Algebraic Definition of Simulation between Programs. Tech. Rept. CS-205, Stanford University, Computer Science Department, 1972.Google Scholar
  27. 27.
    Parnas, D. L. “On the Criteria to be Used in Decomposing Systems into Modules.” Communications of the Association for Computing Machinery 15 (1972).Google Scholar
  28. 28.
    Reichel, H. Behavioral Equivalence — A Unifying Concept for Initial and Final Specifications. In Proceedings, Third Hungarian Computer Science Conference, Springer-Verlag, 1981.Google Scholar
  29. 29.
    Spitzen, J., Levitt, K., and Robinson, L. “An Example of Hierarchical Design and Proof.” Communications of the ACM 21, 12 (1978), 1064–1075.Google Scholar
  30. 30.
    Thatcher, J. W., Wagner, E. G. and Wright, J. B. Data Type Specification: Paramerization and the Power of Specification Techniques. In Proceedings of 1979 POPL, ACM, 1979.Google Scholar
  31. 31.
    Wand, M. “Final Algebra Semantics and Data Type Extension.” J. Comp. Sys. Sciences 19 (1979), 27–44.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • J. Goguen
    • 1
  • J. Meseguer
    • 1
  1. 1.Computer Science laboratorySRI InternationalMenlo Park

Personalised recommendations