Sciweavers

12 search results - page 1 / 3
» Double-Pushout Approach with Injective Matching
Sort
View
TAGT
1998
Springer
250views Graph Theory» more  TAGT 1998»
13 years 9 months ago
Double-Pushout Approach with Injective Matching
Abstract. We investigate and compare four variants of the doublepushout approach to graph transformation. Besides the traditional approach with arbitrary matching and injective rig...
Annegret Habel, Jürgen Müller, Detlef Pl...
BIRTHDAY
2005
Springer
13 years 10 months ago
Changing Labels in the Double-Pushout Approach Can Be Treated Categorically
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
Hans Jürgen Schneider
ENTCS
2007
93views more  ENTCS 2007»
13 years 5 months ago
Modeling Pointer Redirection as Cyclic Term-graph Rewriting
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
Dominique Duval, Rachid Echahed, Fréd&eacut...
ENTCS
2007
108views more  ENTCS 2007»
13 years 5 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig
CVPR
2009
IEEE
15 years 5 days ago
Learning Shape Prior Models for Object Matching
The aim of this work is to learn a shape prior model for an object class and to improve shape matching with the learned shape prior. Given images of example instances, we can le...
Cordelia Schmid, Frédéric Jurie, Tin...