Type inference in flexible model-driven engineering using classification algorithms

被引:0
作者
Athanasios Zolotas
Nicholas Matragkas
Sam Devlin
Dimitrios S. Kolovos
Richard F. Paige
机构
[1] University of York,Computer Science Department
[2] University of Hull,Computer Science Department
来源
Software & Systems Modeling | 2019年 / 18卷
关键词
Model-driven engineering; Flexible model-driven engineering; Bottom-up metamodelling; Type inference; Classification and regression trees; Random forests;
D O I
暂无
中图分类号
学科分类号
摘要
Flexible or bottom-up model-driven engineering (MDE) is an emerging approach to domain and systems modelling. Domain experts, who have detailed domain knowledge, typically lack the technical expertise to transfer this knowledge using traditional MDE tools. Flexible MDE approaches tackle this challenge by promoting the use of simple drawing tools to increase the involvement of domain experts in the language definition process. In such approaches, no metamodel is created upfront, but instead the process starts with the definition of example models that will be used to infer the metamodel. Pre-defined metamodels created by MDE experts may miss important concepts of the domain and thus restrict their expressiveness. However, the lack of a metamodel, that encodes the semantics of conforming models has some drawbacks, among others that of having models with elements that are unintentionally left untyped. In this paper, we propose the use of classification algorithms to help with the inference of such untyped elements. We evaluate the proposed approach in a number of random generated example models from various domains. The correct type prediction varies from 23 to 100% depending on the domain, the proportion of elements that were left untyped and the prediction algorithm used.
引用
收藏
页码:345 / 366
页数:21
相关论文
共 31 条
[1]  
Bak K(2015)Clafer: unifying class and feature modeling Softw. Syst. Model. 15 1-35
[2]  
Diskin Z(2001)Random forests Mach. Learn. 45 5-32
[3]  
Antkiewicz M(1999)What do you mean by collaborative learning Collab. Learn. Cogn. Comput. Approach. 1 1-15
[4]  
Czarnecki K(2008)MARS: a metamodel recovery system using grammar inference Inf. Softw. Technol. 50 948-968
[5]  
Wasowski A(2012)Search-based model transformation by example Softw. Syst. Model. 11 209-226
[6]  
Breiman L(2013)Example-driven meta-model development Softw. Syst. Model. 14 1-25
[7]  
Dillenbourg P(2013)What do metamodels really look like? EESSMOD@ MoDELS 1078 55-60
[8]  
Javed F(2016)Constraint programming for type inference in flexible model-driven engineering Comput. Lang. Syst. Struct. undefined undefined-undefined
[9]  
Mernik M(undefined)undefined undefined undefined undefined-undefined
[10]  
Gray J(undefined)undefined undefined undefined undefined-undefined