-
1
-
-
0033680457
-
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
-
2
-
-
0030173077
-
Graph processes
-
A. Corradini, U. Montanari, and F. Rossi. Graph processes. In Fundamenta Informaticae, volume 26 (3,4), pages 241–266, 1996.
-
(1996)
Fundamenta Informaticae
, vol.26
, Issue.3-4
, pp. 241-266
-
-
Corradini, A.1
Montanari, U.2
Rossi, F.3
-
3
-
-
37149010605
-
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
-
6
-
-
84948991482
-
Rule-based specification of behavioral consistency based on the UML meta-model
-
M. Gogolla and C. Kobryn, editors, LNCS, Springer
-
G. Engels, R. Heckel, and J. M. Küster. Rule-based specification of behavioral consistency based on the UML meta-model. In M. Gogolla and C. Kobryn, editors, Proc. 4th Intl. Conference on The Unified Modeling Language (UML’02), Toronto, Canada, October, 2001, volume 2185 of LNCS, pages 272–287. Springer, 2001.
-
(2001)
Proc. 4Th Intl. Conference on the Unified Modeling Language (UML’02), Toronto, Canada, October, 2001
, vol.2185
, pp. 272-287
-
-
Engels, G.1
Heckel, R.2
Küster, J.M.3
-
7
-
-
0003238687
-
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
-
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
-
10
-
-
84937244943
-
Towards automatic translation of UML models into semantic domains
-
H.-J. Kreowski, editor, Grenoble, France, April
-
R. Heckel, J.M. Küster, and G. Taentzer. Towards automatic translation of UML models into semantic domains. In H.-J. Kreowski, editor, Proc. ETAPS’02 Workshop on Application of Graph Transformation (AGT’02), Grenoble, France, April 2002.
-
(2002)
Proc. ETAPS’02 Workshop on Application of Graph Transformation (AGT’02)
-
-
Heckel, R.1
Küster, J.M.2
Taentzer, G.3
-
13
-
-
13844293430
-
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
-
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
-
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
-
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
-
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
|