G. Engels, R. Heckel, G. Taentzer, and H. Ehrig. A view-oriented approach to system modelling using graph transformation. In Proc. of ESEC/FSE'97, Zurich, LNCS 1301, pages 327--343. Springer Verlag, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....frames are placeholders that hide their contents. For restoring the flat graph G, it is useful to have a flattening operation which recursively replaces every frame with its contents. See also [33] for hiding and restoring transformation rules working on such nested views; the views considered in [16, 45] are not nested. A useful notion of flattening should provide a mechanism which allows us to specify that some node of the contents of a frame f corresponds to a node v outside. More precisely, v should be an attached node of f. Thus, if f has k attached nodes, we need to designate a sequence of ....

H. Ehrig, G. Engels, R. Heckel, and G. Taentzer, A view-oriented approach to system modelling using graph transformation, in "Proc. ESEC/FSE '97," Lecture Notes in Computer Science, Vol. 1301, pp. 327--343, Springer-Verlag, New York/Berlin, 1997.

....frames are placeholders that hide their contents. For restoring the at graph G, it is useful to have a attening operation which recursively replaces every frame with its contents. See also [33] for hiding and restoring transformation rules working on such nested views; the views considered in [16] and [45] are not nested. A useful notion of attening should provide a mechanism which allows to specify that some node of the contents of a frame f corresponds to a node v outside. More precisely, v should be an attached node of f . Thus, if f has k attached nodes, we need to designate a ....

Hartmut Ehrig, Gregor Engels, Reiko Heckel, and Gabriele Taentzer. A view-oriented approach to system modelling using graph transformation. In Proc. ESEC/FSE '97, volume 1301 of Lecture Notes in Computer Science, pages 327-343, 1997.

.... ) qsort partition 6 ( partition 7 partition 7 ) partition partition ( partition qsort qsort ) Figure 11: Sorting a list graph by quicksort 23 hiding and restoring transformation rules working on such nested views; the views considered in [EEHT97] and [TS95] are not nested. A useful notion of attening should provide a mechanism which allows to specify that some node of the contents of a frame f corresponds to a node v outside. More precisely, v should be an attached node of f . Thus, if f has k attached nodes, we need to designate a ....

Hartmut Ehrig, Gregor Engels, Reiko Heckel, and Gabriele Taentzer. A view-oriented approach to system modelling using graph transformation. In Proc. ESEC/FSE '97, volume 1301 of Lecture Notes in Computer Science, pages 327-343, 1997. 30

.... ) qsort partition 6 ( partition 7 partition 7 ) partition partition ( partition qsort qsort ) Figure 11: Sorting a list graph by quicksort 23 hiding and restoring transformation rules working on such nested views; the views considered in [EEHT97] and [TS95] are not nested. A useful notion of flattening should provide a mechanism which allows to specify that some node of the contents of a frame f corresponds to a node v outside. More precisely, v should be an attached node of f . Thus, if f has k attached nodes, we need to designate a ....

Hartmut Ehrig, Gregor Engels, Reiko Heckel, and Gabriele Taentzer. A view-oriented approach to system modelling using graph transformation. In Proc. ESEC/FSE '97, volume 1301 of Lecture Notes in Computer Science, pages 327--343, 1997. 30

....and codomain of a. Essentially the same idea will work for the single pushout approach (L we (1991) L we (1993) by reinterpreting the span used in a double pushout rule (or direct derivation step) as a partial morphism (see Ribeiro (1996) who also uses partial morphism spans for retyping) In Ehrig et al. 1997), Heckel et al. 1997) a similar treatment was presented for a double pullback rewriting construction, essentially intended as a looser version of the double pushout construction rather than an independent construction (and in particular not to be confused with work of Bauderon on rewriting via ....

....reasoning about the exterior concrete case. B C A Fig. 3 B 8 To do more, e.g. to compose concrete or special abstract spans horizontally, requires extra ad hoc machinery. One way of doing this, is to put in place a fixed choice of pullbacks as in the quoted references, Corradini et al. 1996b) Ehrig et al. 1997), and Heckel et al. 1997) Another profitable direction, which we will exploit in this paper, is to restrict attention to monic spans, i.e. spans in which both arrows are monic. Doing this ultimately allows us to compose semiconcrete and abstract spans vertically. Thus there is a subcategory of ....

[Article contains additional citation context not shown here]

Ehrig H., Heckel R., Taentzer G., Engels G. (1997); A View-Oriented Approach to System Modelling Using Graph Transformation, submitted.

No context found.

G. Engels, R. Heckel, G. Taentzer, and H. Ehrig. A view-oriented approach to system modelling using graph transformation. In Proc. of ESEC/FSE'97, Zurich, LNCS 1301, pages 327--343. Springer Verlag, 1997.

No context found.

G. Engels, R. Heckel, G. Taentzer, and H. Ehrig. A view-oriented approach to system modelling using graph transformation. In Proc. of ESEC/FSE'97, Zurich, LNCS 1301, pages 327-343. Springer Verlag, 1997.

No context found.

G. Engels, R. Heckel, G. Taentzer, and H. Ehrig. A vieworiented approach to system modelling using graph transformation. In Proc. ESEC/FSE'97, Zurich, volume 1301 of 1997.

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