Abstract
Formalisms based on graph transformations are used to specify data base applications. Starting from an informal description, two formal specifications — one query-oriented and the other update-oriented — are successively derived.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BARTUSSEK,W. and PARNAS,D. “Using traces to write abstract specifications for software modules” Technical Report 77-012; University of North Carolina (1977)
CLEAVELAND,J.C. and UZGALIS,R.C “Grammars for programming languages”; Elsevier North-Holland (1977).
EHRIG,H. and KREOWSKI,H.J. “Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems”; Information Systems, vol. 5 (1980) 225–238.
FURTADO,A.L. “Transformations of data base structures”; In ‘Graph-Grammars and their Application to Computer Science and Biology'; Claus,V., Ehrig,H. and Rozenberg,G. (eds.); Springer Verlag (1979) 224–236.
FURTADO.A.L. “A W-grammar approach to data bases”; Technical Report 9/82; Pontifícia Universidade Católica do Rio de Janeiro (1982).
FURTADO,A.L and VELOSO,P.A.S. “On multi-level specifications based on traces”; Technical Report 8/81; Pontifícia Universidade Católica do Rio de Janeiro (1981).
GOGUEN,J.A., THATCHER,J.W. and WAGNER,E.G. “An initial algebra approach to the specification, correctness and implementation of abstract data types”; In ‘Current Trends in Programming Methodology', Vol. IV, Yeh.R.T. (ed.); Prentice-Hall (1978).
GUTTAG,J. “Abstract data types and the development of data structures”; Comm. of the ACM, 20 (1977) 397–404.
HESSE,W. “A correspondence between W-grammars and formal systems of logic and its application to formal language description”; Technical Report TUM-INFO-7727, Technische Universität München (1977).
HUET,G and OPPEN,D.C. “Equations and rewrite rules: a survey”; Technical Report STAN-CS-80-785, Stanford University (1980).
LISKOV,B. et al. “Abstraction mechanisms inCLU”; Comm. of the ACM, 20 (1977) 564–576.
RIDJANOVIC,D. and BRODIE,M.L. “Defining database dynamics with attribute grammars”; Information Processing Letters, Vol. 14, n∘ 3 (1982) 132–138.
ROSENKRANTZ,D.J. “Programmed grammars and classes of formal languages”; Journal of the ACM, vol. 16 (1969).
VELOSO,P.A.S. “Methodical specification of abstract data types via rewriting systems”; Technical Report 7/81, Pontifícia Universidade Catolica do Rio de Janeiro, (1981).
VELOSO,P.A.S., CASTILHO,J.M.V. and FURTADO,A.L. “Systematic derivation of complementary specifications”; Proc. Seventh International Conference on Very Large Data Bases; (1981) 409–421.
WAGNER,E.G. “Lecture notes on the algebraic specification of data types”; Technical Report RC 9203 (#39787), IBM Thomas J. Watson Research Center (1981).
WIJNGAARDEN, A. van et al (eds.). “Revised report on the algorithmic language ALGOL 68”; Acta Informatica, 5 (1975) 1–236.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furtado, A.L., Veloso, P.A.S. (1983). Specification of data bases through rewriting rules. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000101
Download citation
DOI: https://doi.org/10.1007/BFb0000101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12310-1
Online ISBN: 978-3-540-39897-4
eBook Packages: Springer Book Archive