Title | ||
---|---|---|
Reducing the Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities. |
Abstract | ||
---|---|---|
Refinements are model transformations that leave large parts of the source models unchanged. Therefore, if refinements are executed outplace, model elements need to be copied to the target model. Refinements written in imperative languages are increasingly verbose, unless suitable language facilities exist for creating these copies implicitly. Thus, for languages restricted to general-purpose facilities, the verbosity of refinements is still an open problem. Existing approaches towards reducing this verbosity suffer from the complexity of developing a higher-order transformation to synthesize the copying code. In this paper, we propose a generic transformation library for creating implicit copies, reducing the verbosity without a higher-order transformation. We identify the underlying general-purpose language facilities, and compare state-of-the-art languages against these requirements. We give a proof of concept using the imperative QVTo language, and showcase the ability of our library to reduce the verbosity of an industrial-scale transformation chain. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1007/978-3-319-61473-1_2 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Model refinement,Implicit copy,Imperative languages | Programming language,Open problem,Computer science,Model refinement,Copying,Imperative programming,Proof of concept,Verbosity,General-purpose language | Conference |
Volume | ISSN | Citations |
10374 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 22 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Christopher Gerking | 1 | 36 | 4.53 |
David Schubert | 2 | 16 | 4.01 |
Ingo Budde | 3 | 0 | 0.68 |