Model Reuse with Metamodel-Based Transformations

Authors:
Tihamer Levendovszky;Gabor Karsai;Miklos Maroti;Akos Ledeczi;Hassan Charaf
Affiliations:
-;-;-;-;-
Venue:
ICSR-7 Proceedings of the 7th International Conference on Software Reuse: Methods, Techniques, and Tools
Year:
2002

Citing 5
Cited 4

Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
The Unified Modeling Language reference manual

The Unified Modeling Language reference manual
Model-Integrated Computing

Computer
Graph Pattern Matching in PROGRES

Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Specification of Graph Translators with Triple Graph Grammars

WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science

Generative Programming for Embedded Systems

GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
A UML class diagram-based pattern language for model transformation systems

SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
On Metamodel-Based Design of Software Metrics

Balancing Agility and Formalism in Software Engineering
A Systematic Approach to Metamodeling Environments and Model Transformation Systems in VMTS

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Metamodel-based transformations permit descriptions of mappings between models created using different concepts from possibly overlapping domains. This paper describes the basic algorithms used in matching metamodel constructs, and how this match is to be applied. The transformation process facilitates the reuse of models specified in one domain-specific modeling language in another context: another domain-specific modeling language. UML class diagrams are used as the language of the metamodels. The focus of the paper is on the matching and firing of transformation rules, and on finding efficient and generic algorithms. An illustrative case study is provided.