M. Andries et. al.,"Graph Transformation for Specification and Programming", Science of Computer Programming, Vol. 34, pp. 1--54, 1999. 7  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hierarchical Graph Transformation - Drewes, Hoffmann, Plump (2002) (14 citations) (Correct)
....realistic size require large numbers of rules, making it imperative to develop systems from small components that are easy to comprehend. Recently, structuring concepts for systems of graph transformation rules have received some attention. A module concept for graph transformation is proposed in [2], for example, and different proposals for module concepts of graph transformation systems are compared with each other in [27] We believe that it will be necessary to structure not only the sets of rules but also the graphs that are subject to transformation, in order to cope with complex ....
.... where the package hierarchy, the underlying graph, and their coupling are represented by three flat graphs, and transformation is defined as componentwise application of rules to these three graphs (even heterogeneously, specified in different transformation approaches of the kind formalized in [2]) This framework is used in [7] to compare the approach introduced here, and the one by Pratt. It may also be used to equip arbitrary graph classes and transformation approaches with a hierarchy concept. The basic idea of distributed graph transformation is to extract several subgraphs from a ....
[Article contains additional citation context not shown here]
M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D. Plump, A. Schrr, and G. Taentzer, Graph transformation for specification and programming, Sci. Computer Programm. 34 (1999), 1--54.
Programming with Logical Links: Design of the LMNtal language.. - Ueda, Kato (2002) (Correct)
....memory management) and (iii) localization of computation (i.e. reaction rules placed at a certain hierarchy can act only on processes at that hierarchy) 3. Transformation. LMNtal has a rewrite rule based syntax. There has been a lot of work on graph grammars and graph rewriting transformation [1], including hierarchical graph transformation [4] but LMNtal s emphasis is on its design from the programming language point of view. The key design issue has been how to deal with free links properly. Rewrite rules specify reaction between elements of a multiset, but reaction between ....
Andries, M. et al., Graph Transformation for Specification and Programming. Sci. Comput. Program., Vol. 34, No. 1 (1999), pp. 1--54.
Integrating the Specification Techniques of Graph.. - Heckel, Ehrig.. (1997) (7 citations) (Correct)
....like hypergraphs, attributed graphs, and relational structures. Behavioural constraints, as an abstract framework, are comparable to control conditions in GRACE, a graph and rule based specification language that is being developed independent of the particular graph transformation approach [15]. It could be an interesting future topic to extend our approach of coalgebraic semantics to this language. Moreover, the coalgebraic semantics has still to be extended to graph grammar morphisms. There are various notions of such morphisms to contend with in literature ( 9,16,10,6] We only ....
M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D. Plump, A. Schurr, and G. Taentzer, "Graph transformation for specification and programming", Tech. Rep. 7/96, University of Bremen, 1996.
Double-Pullback Transitions and Coalgebraic Loose.. - Heckel, Ehrig.. (1997) (1 citation) (Correct)
....of some kind of behavioural constraints. For such systems, in fact, the actual behaviour depends on the interaction with the external environment. Another current stream of research concerns the enrichment of graph transformation based specification with modularity and parametrisation techniques [11, 12]. Also in this case, an open or loose semantics has to be provided for modules with import export interfaces or 1 Mainly in the framework of two European projects, the Esprit Basic Research Working Groups COMPUGRAPH I and II (1989 1996) apcs.tex; 10 03 1997; 15:17; no v. p.2 Double Pullback ....
M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D. Plump, A. Schurr, and G. Taentzer, "Graph transformation for specification and programming." to appear, 1996.
Modules and Updatable Graph Views for PROgrammed Graph.. - Winter, Schürr (1997) (7 citations) (Correct)
.... software design languages like HOOD [30] or EMIL [4, 24] and finally to the development of module concepts for knowledge base representation languages like EPSILON [7] and PROTOS L [2] Rather recently, a number of graph grammar researchers joint their efforts in the so called GRACE initiative [1]. Their common goal is the development of a GRAph Centered Environment, which supports modular programming with various forms of graph data models, rewrite rules, and rule regulation mechanisms. Related publications are first attempts to introduce import export as well as inheritance refinement ....
M. Andries, G. Engels, A. Habel, B. Hoffmann, H. Kreowski, S. Kuske, D. Plump, A. Schurr, and G. Taentzer. Graph Transformation for Specification and Programming. Technical Report 7, University of Bremen, 1996.
Computing by Graph Transformation II (COMPUGRAPH II) - Ehrig, (eds.) (1996) Self-citation (Taentzer) (Correct)
....meetings the graph and rule centered language GRACE has been created which is still in an early stage of development. GRACE supports approach independent and structured graph transformation using transformation units. The current state at the end of the COMPUGRAPH II project is summarized in [AEH 96] 2.5 Deliverables A survey of research goals and main results of the COMPUGRAPH II project was given in [ET95] Two main activities are concerned with the survey and presentation of the overall concepts and results in the COMPUGRAPH II project. 11 Whereas this final report contains the new ....
M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D. Plump, A. Schurr and G. Taentzer. Graph Transformation for Specification and Programming. 1995. To appear.
Computing with Graphs and Graph Rewriting - Blostein, Schürr (1997) (3 citations) Self-citation (Schrr) (Correct)
....rules replace one subtree by another. They are used, for example, to transform parse trees in order to translate between dialects of programming languages. Graph rewrite rules replace one subgraph by another. Contents of the HostGraph Rewriting the HostGraph Generate Visual Language Editors [1] [2] The HostGraph represents the current state of editing, acting as an abstract syntax graph for the language under consideration. See Section 4. Graph rewrite rules modify the HostGraph in response to each editing operation. The syntax (and static semantics) of the visual language are ....
....an edge for each active communication line between processors. Graph rewrite rules activate and deactivate communication lines to replace faulty processors with spares. The use of graph rewriting helps in the design and analysis of reconfiguration algorithms. Implement Functional Languages [1] [13] The HostGraph represents the abstract syntax tree of a program; this tree becomes a Directed Acyclic Graph (DAG) due to sharing of subexpressions. Graph rewrite rules are used to reduce the DAG to a single node. This has the effect of evaluating the program represented by the DAG. ....
M. Andries, G. Engels, A. Habel, B. Hoffmann, H. Kreowski, S. Kuske, D. Plump, A. Schrr, G. Taentzer, "Graph Transformation for Specification and Programming," submitted to Science of Computer Programming, Elsevier Press, May 96.
Graph Transformation Units with Interleaving Semantics - Kreowski, Kuske (1999) (5 citations) Self-citation (Kreowski Kuske) (Correct)
No context found.
Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, HansJ org Kreowski, Sabine Kuske, Detlef Plump, Andy Schurr, Gabriele Taentzer. Graph transformation for specification and programming. Technical Report 7/96, Universitat Bremen, 1996.
Model-based Management of Embedded Service Systems .. - Illner, Krumm.. (2006) (Correct)
No context found.
M. Andries et. al.,"Graph Transformation for Specification and Programming", Science of Computer Programming, Vol. 34, pp. 1--54, 1999. 7
Model-driven Security Management of Embedded Service Systems - Illner, Pohl, Krumm (2005) (Correct)
No context found.
M. Andries et. al.,"Graph Transformation for Specification and Programming", Science of Computer Programming, Vol. 34, pp. 1--54, 1999.
Model-driven Security Management of Embedded Service Systems - Illner, Pohl, Krumm (2005) (Correct)
No context found.
M. Andries et. al., "Graph Transformation for Specification and Programming", Science of Computer Programming, Vol. 34, 1999.
Model Transformations And Tool Integration - Tratt (2004) (Correct)
No context found.
M. Andries, G. Engels, A. Habel, B. Ho#mann, H.- J. Kreowski, S. Kuske, D. Plump, A. Schurr, and G. Taentzer. Graph transformation for specification and programming. Technical Report 7, University of Bremen, 1999.
Transformation Selection for Aptness-Based Web Retrieval - Van Gils Basvg (Correct)
No context found.
Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H.-J., Kuske, S., Plump, D., Sch urr, A. & Taentzer, G. (1999), `Graph transformation for specification and programming', Science of Computer Programming 4(1), 1--54.
Visual Automated Model Transformation - Varro (2001) (Correct)
No context found.
M. Andries et al.: "Graph Transformation for Specification and Programming". Science of Computer Programming, 34 1-54 (1999).
LMNtal: a language model with links and membranes - Kazunori Ueda Norio (Correct)
No context found.
Andries, M. et al., Graph Transformation for Specification and Programming. Sci. Comput. Program., Vol. 34, No. 1 (1999), pp. 1--54. http://www.ueda.info.waseda.ac.jp/lmntal/ 14
On Constructor-based Graph Rewriting Systems - Echahed, Janodet (1997) (Correct)
No context found.
Marc Andries, Gregor Engels, Annegret Habel, Berthold Hoffmann, Hans-Jorg Kreowski, Sabine Kuske, Detlef Plump, Andy Schurr, and Gabriele Taentzer. Graph transformation for specification and programming. ??, 1996. In preparation.
Loose Semantics and Constraints for Graph.. - Heckel, Ehrig, Wolter, .. (1997) (1 citation) (Correct)
No context found.
M. Andries, G. Engels, A. Habel, B. Hoffmann, H.-J. Kreowski, S. Kuske, D. Plump, A. Schurr, and G. Taentzer. Graph transformation for specification and programming. to appear, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC