Abstract
An approach to the formal description of reusable software components is presented which is based on the algebraic specification of abstract data types. A reusable component consists of a tree of algebraic specifications where a specification is a child of another specification if it is an implementation. Every node of the tree is a structured specification. In contrast to other approaches to software reusability these trees are considered as objects of the language and can be constructed and manipulated by operators of the language.
This research has been partially sponsored by the ESPRIT project DRAGON
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bergstra, J. Heering, P. Klint: Module algebra. Math. Centrum Amsterdam, Report CS-R8615.
H. Ehrig, B. Mahr: Fundamentals of algebraic specification 1. EATCS Monographs on Theor. Comp. Science, Vol. 6, Springer Verlag, 1985.
H. Ehrig, H. Weber: Programming in the large with algebraic module specifications. In: H.J. Kugler (ed.): Information Processing 86. Amsterdam: North-Holland, 1986, 675–684.
L.M.G. Feijs, H.B.M. Jonkers, C.P.J. Koymans, G.R. Renardel de Lavalette: The calculus λπ. To appear in: J.A. Bergstra, M. Wirsing(eds.): Algebraic methods: theory, tools and applications. Springer Lecture Notes in Computer Science, 1988.
M.C. Gaudel, Th. Moineau: A theory of software reusability. In: H. Ganzinger (ed.): ESOP '88. Springer Lecture Notes in Computer Science 300, 1988, 115–130.
J.A. Goguen: Parameterized programming. IEEE Trans. on Software Engineering, Vol. SE-10, No. 5, 1984, 528–543.
J.V. Guttag, J.J. Horning, J.M. Wing: Larch in five easy pieces. Digital Systems Research Center, Tech. Report 5, 1985.
Y. Matsumoto: Some experiences in promoting reusable software. IEEE Trans. on Software Engineering, Vol. SE-10, No. 5, 1984, 502–513.
B. Meyer: Reusability: the case for object-oriented design. IEEE Software, March 1987.
B. Meyer: Eiffel: programming for reusability and extendibility. Sigplan Notices 22, 1987.
D.L. Parnass: On the design and development of program families. IEEE Trans. on Software Engineering, Vol. SE-2, No. 1, 1976, 1–9.
D.T. Sannella, A. Tarlecki: Towards formal development of programs from algebraic specifications: implementations revisited. In H. Ehrig et al. (eds.): TAPSOFT 87. Springer Lecture Notes in Computer Science 249, 1987, 96–110.
D.T. Sannella, M., Wirsing: A kernel language for algebraic specifications and implementation. In: Marek Karpinski (ed.): Proc. FCT 83, Found. of Computation Theory, Borgholm, August 1983. Springer Lecture Notes in Computer Science 158, 1983, 413–427.
M. Wirsing: Structured algebraic specifications: a kernel language. Theoretical Computer Science 42, 1986, 123–249.
M. Wirsing: Algebraic description of reusable software components. In: E. Milgrom, P. Wodon (eds.): COMP EURO 88. IEEE Computer Society, 834, Computer Society Press, 1988, 300–312.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wirsing, M., Hennicker, R., Breu, R. (1988). Reusable specification components. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017136
Download citation
DOI: https://doi.org/10.1007/BFb0017136
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive