메뉴 건너뛰기




Volumn 2505, Issue , 2002, Pages 161-176

Confluence of typed attributed graph transformation systems

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; UNIFIED MODELING LANGUAGE;

EID: 84937199516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45832-8_14     Document Type: Conference Paper
Times cited : (166)

References (19)
  • 1
    • 0033680457 scopus 로고    scopus 로고
    • Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation
    • September, Long version available as technical report SI-2000-06, University of Rom
    • P. Bottoni, A. Schürr, and G. Taentzer. Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation. In Proc. IEEE Symposium on Visual Languages, September 2000. Long version available as technical report SI-2000-06, University of Rom.
    • (2000) In Proc. IEEE Symposium on Visual Languages
    • Bottoni, P.1    Schürr, A.2    Taentzer, G.3
  • 3
    • 37149010605 scopus 로고
    • Embedding theorems in the algebraic theory of graph grammars
    • Springer
    • H. Ehrig. Embedding theorems in the algebraic theory of graph grammars. In LNCS 56, pages 245–255. Springer, 1977.
    • (1977) LNCS 56 , pp. 245-255
    • Ehrig, H.1
  • 7
    • 0003238687 scopus 로고    scopus 로고
    • The AGG-Approach: Language and Tool Environment
    • H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Applications, Languages and Tools, World Scientific, See also
    • C. Ermel, M. Rudolf, and G. Taentzer. The AGG-Approach: Language and Tool Environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2: Applications, Languages and Tools, pages 551–603. World Scientific, 1999. See also http://tfs.cs.tu/berlin.de/agg.
    • (1999) Handbook of Graph Grammars and Computing by Graph Transformation , vol.2 , pp. 551-603
    • Ermel, C.1    Rudolf, M.2    Taentzer, G.3
  • 9
    • 0036036781 scopus 로고    scopus 로고
    • Detection of Conflicting Functional Requirements in a Use Case-Driven Approach
    • Orlando, FL, 2002. ACM/IEEE Computer Society
    • J. H. Hausmann, R. Heckel, and G. Taentzer. Detection of Conflicting Functional Requirements in a Use Case-Driven Approach. In Proc. 24th Intl. Conference on Software Engineering, Orlando, FL, 2002. ACM/IEEE Computer Society.
    • Proc. 24Th Intl. Conference on Software Engineering
    • Hausmann, J.H.1    Heckel, R.2    Taentzer, G.3
  • 13
    • 13844293430 scopus 로고    scopus 로고
    • A formal semantics of UML state machines based on structured graph transformation
    • M. Gogolla and C. Kobryn, editors, Springer-Verlag
    • S. Kuske. A formal semantics of UML state machines based on structured graph transformation. In M. Gogolla and C. Kobryn, editors, Proc. UML 2001, Toronto, Kanada, volume 2185 of LNCS. Springer-Verlag, 2001.
    • (2001) Proc. UML 2001, Toronto, Kanada, Volume 2185 of LNCS
    • Kuske, S.1
  • 14
    • 0002274099 scopus 로고
    • An algebraic framework for the transformation of attributed graphs
    • John Wiley & Sons Ltd
    • M. Löwe, M. Korff, and A. Wagner. An algebraic framework for the transformation of attributed graphs. In Term Graph Rewriting: Theory and Practice, pages 185–199. John Wiley & Sons Ltd, 1993.
    • (1993) Term Graph Rewriting: Theory and Practice , pp. 185-199
    • Löwe, M.1    Korff, M.2    Wagner, A.3
  • 15
    • 0000187751 scopus 로고
    • On theories with a combinatorial definition of’equivalence’
    • M. H. A. Newman. On theories with a combinatorial definition of’equivalence’. In Annals of Mathematics, 43 (2), pages 223–243, 1942.
    • (1942) Annals of Mathematics , vol.43 , Issue.2 , pp. 223-243
    • Newman, M.1
  • 17
    • 0000975250 scopus 로고
    • Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence
    • M.R Sleep, M.J. Plasmeijer, and M. C.J.D. van Eekelen, editors, Wiley
    • D. Plump. Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence. In M.R Sleep, M.J. Plasmeijer, and M. C.J.D. van Eekelen, editors, Term Graph Rewriting, pages 201–214. Wiley, 1993.
    • (1993) Term Graph Rewriting , pp. 201-214
    • Plump, D.1
  • 18
    • 0002561283 scopus 로고    scopus 로고
    • Term graph rewriting
    • G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Applications, Languages, and Tools, World Scientific
    • D. Plump. Term graph rewriting. In G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools, pages 3–62. World Scientific, 1999.
    • (1999) , Handbook of Graph Grammars and Computing by Graph Transformation , vol.2 , pp. 3-62
    • Plump, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.