Reference : Efficient Analysis and Execution of Correct and Complete Model Transformations Based ...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/5607
Efficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars
English
Hermann, Frank mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Ehrig, Hartmut [> >]
Golas, Ulrike [> >]
Fernando, Orejas [> >]
2010
Proc. Int. Workshop on Model Driven Interoperability (MDI'10)
B├ęzivin, Jean
Soley, R.M.
Vallecillo, A.
ACM
MDI'10
22--31
Yes
978-1-4503-0292-0
Int. Workshop on Model Driven Interoperability (MDI'10)
2010
Oslo, Norway
[en] functional behaviour ; model transformation ; triple graph grammars
[en] Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and analysis of bidirectional model transformations. In previous work we have formalized and analyzed already termination, correctness, completeness, local confluence and functional behaviour. In this paper, we show how to improve the efficiency of the execution and analysis of model transformations in practical applications by using triple rules with negative application conditions (NACs). In addition to specification NACs, which improve the specification of model transformations, the generation of filter NACs improves the efficiency of the execution and the analysis of functional behaviour supported by critical pair analysis of the tool AGG. We illustrate the results for the well-known model transformation from class diagrams to relational database models.
http://hdl.handle.net/10993/5607
10.1145/1866272.1866277
http://tfs.cs.tu-berlin.de/publikationen/Papers10/HEGO10.pdf

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
p22-hermann.pdfPublisher postprint1.18 MBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.