## A Domain-Specific Visual Language for Domain Model Evolution (2004)

Venue: | Journal of Visual Languages and Computing |

Citations: | 31 - 5 self |

### BibTeX

@ARTICLE{Sprinkle04adomain-specific,

author = {Jonathan Sprinkle and Gabor Karsai},

title = {A Domain-Specific Visual Language for Domain Model Evolution},

journal = {Journal of Visual Languages and Computing},

year = {2004},

volume = {15},

pages = {3--4}

}

### Years of Citing Articles

### OpenURL

### Abstract

Domain-specific visual languages (DSVLs) are concise and useful tools that allow the rapid development of the behavior and/or structure of applications in well-defined domains. These languages are typically developed specifically for a domain, and have a strong cohesion to the domain concepts, which often appear as primitives in the language. The strong cohesion between DSVL language primitives and the domain is a benefit for development by domain experts, but can be a drawback when the domain evolves – even when that evolution appears insignificant. This paper presents a domain-specific visual language developed expressly for the evolution of domain-specific visual languages, and uses concepts from graph-rewriting to specify and carry out the transformation of the models built using the original DSVL. 1.

### Citations

124 | Specification of Graph Translators with Triple Graph Grammars
- Schürr
- 1995
(Show Context)
Citation Context ...h exists in the area of graph transformation, and specifically in graph transformation languages. Well-formed arguments for the benefits of several types of graph rewriting approaches are found in [9]=-=[10]-=-[11][12]. There are also tools that claim to have devised a universal solution to the graph rewriting problem [13][14]. Most of these tools operate on a particular source graph (called the input graph... |

87 |
Introduction to Graph Theory, (2-nd edition
- West
(Show Context)
Citation Context ...efined visualization method. Graph rewriting has been used to solve compiler theory problems [2][3], formalization of basic mathematical theory [4], not to mention graph theory and algorithm problems =-=[5]-=-. More recently, and to the subject of semantic mappings in high-level languages, graph rewriting (in the form of graph transformations) has been used as a sort of universal semantic description langu... |

77 |
H.: Conceptual Mathematics: A First Introduction to Categories
- Lawvere, Schanuel
- 1997
(Show Context)
Citation Context ...ful tool for solving abstract problems that have a welldefined visualization method. Graph rewriting has been used to solve compiler theory problems [2][3], formalization of basic mathematical theory =-=[4]-=-, not to mention graph theory and algorithm problems [5]. More recently, and to the subject of semantic mappings in high-level languages, graph rewriting (in the form of graph transformations) has bee... |

61 | B.: Modeling languages: Syntax, semantics and all that stuff, part I: The basic stuff
- Harel, Rumpe
- 2000
(Show Context)
Citation Context ... the DSVL’s translator that performs the mapping from domain model (the language of the DSVL) to the semantic domain. The implementation of thesdynamic semantics is known as the semantic mapping (see =-=[16]-=- for more information). Note that the executable form (i.e., domain artifact) need not necessarily be executable machine code, but can take the form of C++/Java files, SQL database constraints, XML sc... |

36 | Programmed graph replacement systems
- Schürr
(Show Context)
Citation Context ...ments for the benefits of several types of graph rewriting approaches are found in [9][10][11][12]. There are also tools that claim to have devised a universal solution to the graph rewriting problem =-=[13]-=-[14]. Most of these tools operate on a particular source graph (called the input graph) and produce an output (or target) graph. Nodes are traversed and matched based on syntax patterns entered into t... |

30 |
A Portable Compiler: Theory and Practice
- Johnson
- 1978
(Show Context)
Citation Context ...w of the area is provided. Graph rewriting is a useful tool for solving abstract problems that have a welldefined visualization method. Graph rewriting has been used to solve compiler theory problems =-=[2]-=-[3], formalization of basic mathematical theory [4], not to mention graph theory and algorithm problems [5]. More recently, and to the subject of semantic mappings in high-level languages, graph rewri... |

23 |
Retargetable Compiler Code Generation
- Ganapathi, Fischer, et al.
- 1982
(Show Context)
Citation Context ...f the area is provided. Graph rewriting is a useful tool for solving abstract problems that have a welldefined visualization method. Graph rewriting has been used to solve compiler theory problems [2]=-=[3]-=-, formalization of basic mathematical theory [4], not to mention graph theory and algorithm problems [5]. More recently, and to the subject of semantic mappings in high-level languages, graph rewritin... |

22 |
Model Translation: A UML-based specification technique and active implementation approach
- Akehurst
- 2000
(Show Context)
Citation Context ...raph transformations) has been used as a sort of universal semantic description language that allows the specification for transformation from one syntax pattern to another. This approach appeared in =-=[6]-=- as a semantic extension for UML. Lately, graph grammars (the syntax used to express graph transformations) have been suggested as an implementation platform for the Model Driven Architecture (MDA) [7... |

17 | Tooling the MDA framework: a new software maintenance and evolution scheme proposal http://www.sciences.univnantes.fr/info/lrsg/Pages_perso/Publications/j oop01.pdf
- Ploquin
(Show Context)
Citation Context ...6] as a semantic extension for UML. Lately, graph grammars (the syntax used to express graph transformations) have been suggested as an implementation platform for the Model Driven Architecture (MDA) =-=[7]-=-[8]. ? → → ? (a) (b) Figure 2. (a) A pattern and its transformation rule. (b) The desired transformation is sometimes difficult to specify unambiguously. ? ? ? ?sGraph rewriting takes two forms: repla... |

17 |
Karsai G., Generative Programming via Graph Transformations
- Agrawal, Levendovszky, et al.
- 2002
(Show Context)
Citation Context ...as a semantic extension for UML. Lately, graph grammars (the syntax used to express graph transformations) have been suggested as an implementation platform for the Model Driven Architecture (MDA) [7]=-=[8]-=-. ? → → ? (a) (b) Figure 2. (a) A pattern and its transformation rule. (b) The desired transformation is sometimes difficult to specify unambiguously. ? ? ? ?sGraph rewriting takes two forms: replacem... |

11 |
Adding Graph Transformation Concepts to UML's Constraint Language OCL
- Schürr
- 2001
(Show Context)
Citation Context ...ists in the area of graph transformation, and specifically in graph transformation languages. Well-formed arguments for the benefits of several types of graph rewriting approaches are found in [9][10]=-=[11]-=-[12]. There are also tools that claim to have devised a universal solution to the graph rewriting problem [13][14]. Most of these tools operate on a particular source graph (called the input graph) an... |

5 |
Computing with Graphs and Graph
- Blostein, Schürr
- 1999
(Show Context)
Citation Context ...arch exists in the area of graph transformation, and specifically in graph transformation languages. Well-formed arguments for the benefits of several types of graph rewriting approaches are found in =-=[9]-=-[10][11][12]. There are also tools that claim to have devised a universal solution to the graph rewriting problem [13][14]. Most of these tools operate on a particular source graph (called the input g... |

3 | From Trees to Graphs: Defining the Semantics of Diagram Languages with Graph Transformation
- Engels, Heckel
- 2000
(Show Context)
Citation Context ... in the area of graph transformation, and specifically in graph transformation languages. Well-formed arguments for the benefits of several types of graph rewriting approaches are found in [9][10][11]=-=[12]-=-. There are also tools that claim to have devised a universal solution to the graph rewriting problem [13][14]. Most of these tools operate on a particular source graph (called the input graph) and pr... |

2 |
The Programmers who Created the Software Revolution – Go To, Basic Books
- Lohr
- 2001
(Show Context)
Citation Context ... and carry out the transformation of the models built using the original DSVL. 1. Introduction The concept of the domain-specific language has existed since the first computer languages were designed =-=[1]-=-. The expense and relative infancy of the computer required efficient code with a small footprint – thus many programs were fine-tuned in assembly code. When languages such as COBOL and FORTRAN emerge... |