{"title":"Formalizing MDA-Based Refactorings","authors":"L. Favre, C. Pereira","doi":"10.1109/ASWEC.2008.15","DOIUrl":"https://doi.org/10.1109/ASWEC.2008.15","url":null,"abstract":"The model driven architecture (MDA) is an initiative proposed by the Object Management Group (OMG) to model centric software development. It is based on the concepts of models, metamodels and automatic transformations. A crucial part of the evolution from abstract models to executable components or applications is accomplished by means of refactoring. MDA-based refactorings can be specified in the Object Constraint Language (OCL) as contracts between metamodels. We propose an alternative formalization based on the NEREUS language that can be viewed as an intermediate notation open to many formal languages. We show how to transform automatically OCL contracts into NEREUS. We propose a uniform treatment of refactoring at platform independent, platform specific and implementation specific abstraction levels.","PeriodicalId":231903,"journal":{"name":"19th Australian Conference on Software Engineering (aswec 2008)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132964161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Code Generation for Derived Associations","authors":"Jens Dietrich, Bastian Schenke, Gerd Wagner","doi":"10.1109/ASWEC.2008.36","DOIUrl":"https://doi.org/10.1109/ASWEC.2008.36","url":null,"abstract":"While the generation of executable code for explicit associations in UML models is well understood, it is less clear how executable code can be generated if the associations are derived. We discuss how this can be achieved for an important class of derived associations that are defined by means of derivation rules. The result is optimized and executable (as opposed to template) code. The generated code supports semantic reflection, that is, runtime access to the rules used to define the association. We relate these features to use cases from the area of business rules. We also present the Take rule compiler, a Java implementation of the principles discussed.","PeriodicalId":231903,"journal":{"name":"19th Australian Conference on Software Engineering (aswec 2008)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116930935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}