Abstract
Among the design issues for symbolic computation systems, a non trivial one is the design of the database where informations (specifications, proofs, test sets, program modules, etc.) that are necessary to use the various tools available are stored. In this paper we address the design of a database for an algebraic specification environment, and provide an algebraic specification for this database management. One of the issues in this design is to distinguish between “static” aspects, i.e. the attribute updating that is necessary to preserve the database consistency when a single action takes place, and the “dynamic” aspects, that take into account the management of concurrent accesses to the database. The specification language modularity was crucial in order to correctly specify such notions as “coherent list of attributes”, “coherent list of modules”, etc. Since various cases of attribute dependencies were studied (transitive dependence of a given module attributes, and dependence w.r.t. other module attributes), the specification may be easily modified to take into account modifications in the environment architecture (when new tools are added, some new attributes may be necessary). In the same way, this specification could be adapted to specify other symbolic computation systems database management.
Due to lack of space the extension of the specified database to the dynamic one is not given here, but this extension is a further argument to demonstrate the feasability and interest of our approach.
E-mail: mb or cc, uucp: sun8.lri.fr bitnet: frlri61
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6 References
Goguen J., Thatcher J., Wagner E.: An initial algebra approach to the specification, correctness and implementation of abstract data types; Current Trends in Programming Methodology, Vol. 4, Yeh Ed., Prentice Hall, 1978.
Bidoit M.: The stratified loose approach: a generalization of initial and loose semantics; Recent Trends in Data Type Specification, Selected Papers of the 5th Workshop on Specifications of Abstract Data Types, Gullane, Ecosse, Springer-Verlag L.N.C.S. 332, pp. 1–22, 1988.
Bidoit M.: Pluss, un langage pour le développement de spécifications algébriques modulaires; Thèse d'Etat, University of Paris-South, 1988.
Bidoit M., Choppy C.: ASSPEGIQUE: an integrated environment for algebraic specifications; Formal Methods and Software Developments, Proc. International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, Mars 1985, Vol. 2: Colloquium on Software Engineering (CSE), L. N. C. S. 186, Springer Verlag, pp 246–260.
Bidoit M., Choppy C., Voisin F.: The ASSPEGIQUE specification environment, Motivations and design; Proc. of the 3rd Workshop on Theory and Applications of Abstract data types, Bremen, Nov 1984, Recent Trends in Data Type Specification (H.-J. Kreowski ed.), Informatik-Fachberichte 116, Springer Verlag, Berlin-Heidelberg, 1985, pp 54–72.
Bidoit M., Capy F., Choppy C., Choquet N., Gresse C., Kaplan S., Schlienger F., Voisin F.: ASSPRO: an interactive and integrated programming environment; Technology and Science of Informatics, Vol. 6, Num. 4, pp. 259–278, 1987. Techniques et Sciences Informatiques, vol 6, no 1, Janvier 1987.
Bidoit M., Gaudel M.C., Hagelstein J., Mauboussin A.: From an ERAE requirement specification to a PLUSS algebraic specification: A case study; Proc. of the METEOR Workshop “Methods based on Formal Specifications”, Eindhoven, Netherlands, September 1989.
Bidoit M., Gaudel M.C., Mauboussin A.: How to make algebraic specifications more understandable ? An experiment with the PLUSS specification language; Science of Computer Programming, 12(1), 1989.
Biebow B., Hagelstein J.: Algebraic specification of synchronisation and errors: a telephonic example; in Mathematical Foundations of Software Development — Proc. TAPSOFT, Berlin, L.N.C.S. no 186, Springer Verlag, 1985, pp 294–308.
Broy M.: Algebraic methods for program construction: the project CIP; in Program transformations and programming environments, Pepper P. (ed.), NATO ASI Series F: Computer and System Sciences, Vol. 8, Springer, 1984, pp 199–222.
Burstall R.M., Goguen J.A.: Putting theories together to make specifications; Proc. 5th Int. Conf. on Artificial Intelligence, Cambridge MA, 1977, pp 1045-58.
Capy F.: ASSPEGIQUE: un environnment d'exceptions ... Une sémantique opérationnelle des E,R-algèbres prenant en compte les exceptions. Un environnment intégré de spécification algébrique: ASSPEGIQUE; Thèse de 3ème cycle, Université d'Orsay, Dec. 1987.
Capy F.: ASSPEGIQUE — Le langage de spécification: PLUSS — Manuel de référence; L.R.I. Research Report no 418, March 1988.
Choppy C.: Techniques et aspects du prototypage; Génie Logiciel no 3, pp 4–12, Janvier 1986.
Ehrig H., Fey W., Hansen H.: ACT ONE: An algebraic specification language with two levels of semantics; Technical Report 83-03, Department of Computer Science, TU Berlin, 1983.
Ehrig H., Mahr B.: Fundamentals of Algebraic Specifications 1; Springer Verlag, 1985.
Forgaard R., Guttag J.V.: REVE: a term rewriting system generator with failure-resistant Knuth-Bendix; Proc. of an NSF workshop on the rewrite rule laboratory, and: Report no 84GEN008, Avril 1984, General Electric.
Futatsugi K., Goguen J.A., Jouannaud J.P., Meseguer J.: Principles of OBJ2; Proc. 12th ACM Symp. on Principle of Programming Languages, New Orleans, Jan. 1985, pp 52–66.
Fribourg L.: Handling function definitions through innermost superposition and rewriting; Proc. 1st Conference on “Rewriting Techniques and Applications”, Dijon, Mai 1985.
Gaudel M.C.: Towards structured algebraic specifications; Proc. ESPRIT Technical Week, Bruxelles 1985, Springer Verlag.
Guttag J.V., Horning J.J.: Report on the Larch Shared Language; Sci. of Comp. programming, 6, 2, 1986, pp 103–134.
Kaplan S.: A compiler for conditional rewriting systems; Proc. 2nd Conf. on Rewriting techniques and applications, Bordeaux, L.N.C.S. no 256, Springer Verlag, pp 25–41, May 1987.
Kaplan S.: Simplifying conditional term rewriting systems: unification and confluence; Journal of Symbolic Computation, Vol. 4, n o 3, pp 295–335.
Lescanne P.: Computer experiments with the REVE term rewriting system generator; Proc. 10th Symp. on Principle of Programming Languages, A.C.M., Austin TX, USA, pp. 99–108.
Shooman M. L.: Software Engineering; International Student Edition, McGraw Hill Book Company, 1983, p 40.
Slog 1.1, User's Manual; C.G.E. Report, Route de Nozay, 91460 Marcoussis, France, August 1986.
Voisin F.: CIGALE: a tool for interactive grammar construction and expressions parsing; Science of Computer Programming, Vol. 7, no 1, 1986, pp. 61–86.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bidoit, M., Capy, F., Choppy, C. (1990). The design and specification of the ASSPEGIQUE database. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1990. Lecture Notes in Computer Science, vol 429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52531-9_141
Download citation
DOI: https://doi.org/10.1007/3-540-52531-9_141
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52531-8
Online ISBN: 978-3-540-47014-4
eBook Packages: Springer Book Archive