Skip to main content

Development of algebraic specifications with constraints

  • Part 1: Fundamental Categorical Methods In Computer Science
  • Conference paper
  • First Online:
Categorical Methods in Computer Science With Aspects from Topology

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 393))

Abstract

In this paper we study the development of (algebraic) specifications. The main issues are the following: 1) We are able to work with "incomplete" specifications, i.e. specifications in which some objects (data sorts or operations) are not fully described. Technically, this is handled by means of loose semantics with data constraints. Two basic kinds of refinements are used or the specification building: horizontal and vertical refinements. Horizontal refinements are defined as loose extensions, whether vertical refinements are defined by means of refinement morphisms. The combination of both kinds of refinements (horizontal composition) provides a form of parameter passing, in fact the results obtained here generalize the results of the standard approach. A notion of relative persistency is introduced allowing to obtain full compatibility between the model and the specification level semantics for the kind of specification building operations used here. Moreover, proof-theoretic sufficient conditions are given for checking this property.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. Bergstra, J.A.; Broy, M.; Tucker, J.V.; Wirsing, M. On the power of algebraic specifications, Proc. MFCS 1981, Springer LNCS 118, pp. 193–204.

    Google Scholar 

  2. Burstall, R.M.; Goguen, J.A. The semantics of Clear, a specification language, in Abstract Software Specificatior, Springer LNCS 86, pp. 292–332, 1980.

    Google Scholar 

  3. Clerici, S.; Orejas, F. GSBL: an algebraic specification language based on inheritance, Proc. Europ. Conf. on Object Oriented Programming, (Oslo, 1988), Springer LNCS.

    Google Scholar 

  4. Ehrig, H. A categorical concept of constraints for algebraic specifications, T.U. Berlin November 1988.

    Google Scholar 

  5. Ehrig, H., Wagner, E.G. Thatcher, J.W. Algebraic constraints for specifications and canonical form results, Inst. für Soft. und Th. Informatik, T.U. Berlin Bericht 82-09, 1982.

    Google Scholar 

  6. Ehrig, H., Mahr, B.Fundamentals of algebraic specification 1, EATCS Monographs on Theor. Comp. Sc., Springer Verlag, 1985.

    Google Scholar 

  7. Ehrig, H., Thatcher, J.W., Lucas, P., Zilles, S.N. Denotational and initial algebra semantics of the algebraic specification language LOOK, Draft Rep., IBM Research, 1982.

    Google Scholar 

  8. Ganzinger, H. Parameterized specifications: parameter passing and implementation with respect to observability, TOPLAS 5,3 (1983), pp. 318–354.

    Google Scholar 

  9. Goguen, J.A., Burstall, R.M. CAT, a system for the structured elaboration of correct programs from structured specifications, Tech. Rep. CSL-118, SRI Int., 1980

    Google Scholar 

  10. Goguen, J.A., Meseguer, J. Order-sorted algebra I: partial and overloaded operations, errors and inheritance. Technical Report, SRI International, Computer Science Lab 1983.

    Google Scholar 

  11. MacQueen D.B., Sannella, D.T. Completeness of proof systems for equational specifications. IEEE Trans. on Software Engineering, SE-11(5), 454–461 (1985).

    Google Scholar 

  12. Meyer B. Genericity versus Inheritance, Proc. ACM Conf. Object-Oriented Programming Syst, Languages, and Applications, ACM, New York, 1986, pp. 391–405

    Google Scholar 

  13. Nivela, P.; Orejas, F. Initial behaviour semantics, in ‘Recent Trends in Algebraic Specification', D. Sannella, A. Tarlecki (eds.), Springer LNCS, 1988.

    Google Scholar 

  14. Orejas, F., Nivela, P., Ehrig, H. Categorical constructions for behavioural specifications, Dept. de LSI, Univ. Polit. de Catalunya, Barcelona 1988.

    Google Scholar 

  15. Reichel, H. Initially restricting algebraic theories, Proc. MFCS 80, Springer LNCS 88 (1980), pp. 504–514.

    Google Scholar 

  16. Sannella, D. A new semantics for Clear, Report CSR-79-8, Univ. of Edinburgh, 1981.

    Google Scholar 

  17. Sannella, D.; Tarlecki A. On observational equivalence and algebraic specification. J. Comp. and Sys. Sciences 34, pp. 150–178 (1987).

    Google Scholar 

  18. Sannella, D; Tarlecki A. Toward formal development of programs from algebraic specifications: implementations revisited. Proc. Joint Conf. on Theory and Practice of Software Development, Pisa, Springer LNCS 249, pp. 96–110 (1987).

    Google Scholar 

  19. Sannella, D; Wirsing, M. A kernel language for algebraic specification and implementation, Proc. FCT-83, Springer LNCS 158, pp. 413–427, 1983.

    Google Scholar 

  20. Wirsing, M., Pepper, P., Partsch, H., Dosch, W., Broy, M. On hierarchies of abstract data types, Acta Informatica 20 (1983), pp. 1–33.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. Ehrig H. Herrlich H. -J. Kreowski G. Preuß

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orejas, F., Sacristán, V., Clerici, S. (1989). Development of algebraic specifications with constraints. In: Ehrig, H., Herrlich, H., Kreowski, H.J., Preuß, G. (eds) Categorical Methods in Computer Science With Aspects from Topology. Lecture Notes in Computer Science, vol 393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51722-7_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-51722-7_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51722-1

  • Online ISBN: 978-3-540-46787-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics