Specification of data bases through rewriting rules

  • A. L. Furtado
  • P. A. S. Veloso
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)


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.


Graph Transformation Informal Description Abstract Data Type Primitive Operation Attribute Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    BARTUSSEK,W. and PARNAS,D. “Using traces to write abstract specifications for software modules” Technical Report 77-012; University of North Carolina (1977)Google Scholar
  2. [2]
    CLEAVELAND,J.C. and UZGALIS,R.C “Grammars for programming languages”; Elsevier North-Holland (1977).Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    FURTADO.A.L. “A W-grammar approach to data bases”; Technical Report 9/82; Pontifícia Universidade Católica do Rio de Janeiro (1982).Google Scholar
  6. [6]
    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).Google Scholar
  7. [7]
    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).Google Scholar
  8. [8]
    GUTTAG,J. “Abstract data types and the development of data structures”; Comm. of the ACM, 20 (1977) 397–404.Google Scholar
  9. [9]
    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).Google Scholar
  10. [10]
    HUET,G and OPPEN,D.C. “Equations and rewrite rules: a survey”; Technical Report STAN-CS-80-785, Stanford University (1980).Google Scholar
  11. [11]
    LISKOV,B. et al. “Abstraction mechanisms inCLU”; Comm. of the ACM, 20 (1977) 564–576.Google Scholar
  12. [12]
    RIDJANOVIC,D. and BRODIE,M.L. “Defining database dynamics with attribute grammars”; Information Processing Letters, Vol. 14, n∘ 3 (1982) 132–138.Google Scholar
  13. [13]
    ROSENKRANTZ,D.J. “Programmed grammars and classes of formal languages”; Journal of the ACM, vol. 16 (1969).Google Scholar
  14. [14]
    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).Google Scholar
  15. [15]
    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.Google Scholar
  16. [16]
    WAGNER,E.G. “Lecture notes on the algebraic specification of data types”; Technical Report RC 9203 (#39787), IBM Thomas J. Watson Research Center (1981).Google Scholar
  17. [17]
    WIJNGAARDEN, A. van et al (eds.). “Revised report on the algorithmic language ALGOL 68”; Acta Informatica, 5 (1975) 1–236.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • A. L. Furtado
    • 1
  • P. A. S. Veloso
    • 1
  1. 1.Pontificia Universidade Católica do R.J.Brasil

Personalised recommendations