Transformation of shaped nested graphs and diagrams

Electronic Notes in Theoretical Computer Science

Volumn 59, Issue 4, 2001, Pages 305-319

  Hoffmann, Berthold ^a   Minas, Mark ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Diagram language; Nested graph; Structural graph typing; Transformation

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; FILE EDITORS; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; SOFTWARE ENGINEERING; USER INTERFACES;

DIAGRAM LANGUAGES; NESTED GRAPH TRANSFORMATION; NESTED GRAPHS; STRUCTURAL GRAPH TYPING;

COMPUTER PROGRAMMING;

EID: 1542385285     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00294-4     Document Type: Conference Paper

References (25)

1. R. Bardohl, M. Minas, A. Schürr, and G. Taentzer. Application of graph transformation to visual languages. In Engels et al. [6], chapter 3, pages 105-180.
2. G. Busatto and B. Hoffmann. Comparing notions of hierarchical graph transformation. Electronic Notes in Theoretical Computer Science, 2001. to appear.
3. G. Busatto, H.-J. Kreowski, and S. Kuske. An abstract hierarchical graph data model. Technical report, Fachbereich Mathematik-Informatik, Universität Bremen, to appear 2001.
4. F. Drewes, A. Habel, and H.-J. Kreowski. Hyperedge replacement graph grammars. In Rozenberg [21], chapter 2, pages 95-162.
5. F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, to appear 2001.
6. (A short version appeared in number 1784 of Lecture Notes in Computer Science, pages 98-113, 2000).
7. Engels G., Ehrig H., Kreowski H.-J., Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Specification and Programming. 1999;World Scientific, Singapore
8. G. Engels and R. Heckel. Graph transformation as a conceptual and formal framework for system modelling and evolution. In U. Montanari, J. Rolim, and E. Welz, editors, Automata, Languages, and Programming (ICALP 2000 Proc.), number 1853 in Lecture Notes in Computer Science, pages 127-150. Springer, 2000.
9. R. Farrow, K. Kennedy, and L. Zucconi. Graph grammars and global program data flow analysis. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 42-56, Houston, Texas, 1976.
10. Fradet P., Le Métayer D. Structured Gamma. Science of Computer Programming. 31:(2/3):1998;263-289
11. B. Hoffmann. From graph transformation to rule-based programming with diagrams. In M. Nagl, A. Schürr and M. Münch, editors, Int'l Workshop on Applications of Graph Transformations with Industrial Relevance (Agtive'99), Selected Papers, number 1779 in Lecture Notes in Computer Science, pages 165-180. Springer, 2000.
12. B. Hoffmann. Shapely hierarchical graph transformation. In Int'l Symposium on Visual Languages and Formal Methods. IEEE Computer Press, to appear 2001.
13. B. Hoffmann and M. Minas. A generic model for diagram syntax and semantics. In J. D. P. Polim et al., editors, ICALP Workshops 2000, number 8 in Proceedings in Informatics, pages 443-450, Waterloo, Ontario, Canada, 2000. Carleton Scientific.
14. Huet G. Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM. 27:(4):1980;797-821
15. Kennaway R., Klop J.W., Sleep R.F.-J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation. 119:(1):1995;18-38
16. Klop J.W. Term rewriting systems. Abramsky S., Gabbay D.M., Maibaum T. Handbook of Logic in Computer Science, volume 2. 1992;1-116 Oxford University Press
17. M. Minas. Concepts and realization of a diagram editor generator based on hypergraph transformation. Science of Computer Programming, to appear 2001.
18. Plump D. Church-Rosser hypergraph languages. Talk at the Workshop. "Automaten und Formale Sprachen" September 1999;Schauenburg-Elmshagen, Germany
19. D. Plump. Term graph rewriting. In Engels et al. [6], chapter 1, pages 3-102.
20. D. Plump and A. Habel. Graph unification and matching. In J. E. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, number 1073 in Lecture Notes in Computer Science, pages 75-89. Springer, 1996.
21. T. W. Pratt. Definition of programming language semantics using grammars for hierarchical graphs. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science and Biology, number 73 in Lecture Notes in Computer Science, pages 389-400. Springer, 1979.
22. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation Vol. I: Foundations. 1997;World Scientific, Singapore
23. Rumbaugh J., Jacobson I., Booch G. The Unified Modeling Language Reference Manual. Object Technology Series. 1999;Addison Wesley
24. Sagiv M., Reps T., Wilhelm R. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems. 20:(1):1998;1-50
25. A. Schürr, A. Winter, and A. Zündorf. The Progres approach: Language and environment. In Rozenberg [21], chapter 13, pages 487-550.