Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems最新文献_第2页

Towards model-based bias mitigation in machine learning 机器学习中基于模型的偏见缓解

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552401

A. Yohannis, D. Kolovos

引用次数: 3

Machine learning methods for model classification: a comparative study 模型分类的机器学习方法:比较研究

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552461

José Antonio Hernández López, Riccardo Rubei, J. Cuadrado, D. D. Ruscio

{"title":"Machine learning methods for model classification: a comparative study","authors":"José Antonio Hernández López, Riccardo Rubei, J. Cuadrado, D. D. Ruscio","doi":"10.1145/3550355.3552461","DOIUrl":"https://doi.org/10.1145/3550355.3552461","url":null,"abstract":"In the quest to reuse modeling artifacts, academics and industry have proposed several model repositories over the last decade. Different storage and indexing techniques have been conceived to facilitate searching capabilities to help users find reusable artifacts that might fit the situation at hand. In this respect, machine learning (ML) techniques have been proposed to categorize and group large sets of modeling artifacts automatically. This paper reports the results of a comparative study of different ML classification techniques employed to automatically label models stored in model repositories. We have built a framework to systematically compare different ML models (feed-forward neural networks, graph neural networks, k-nearest neighbors, support version machines, etc.) with varying model encodings (TF-IDF, word embeddings, graphs and paths). We apply this framework to two datasets of about 5,000 Ecore and 5,000 UML models. We show that specific ML models and encodings perform better than others depending on the characteristics of the available datasets (e.g., the presence of duplicates) and on the goals to be achieved.","PeriodicalId":303547,"journal":{"name":"Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124336638","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}

引用次数: 4

Schema inference for multi-model data 多模型数据的模式推断

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552400

P. Koupil, Sebastián Hricko, I. Holubová

引用次数: 1

Model-checking legal contracts with SymboleoPC 使用SymboleoPC检查法律合同的模型

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552449

Alireza Parvizimosaed, Marco Roveri, Aidin Rasti, Daniel Amyot, L. Logrippo, J. Mylopoulos

引用次数: 0

Quantifying the variability mismatch between problem and solution space 量化问题和解决方案空间之间的可变性不匹配

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552411

Marc Hentze, Chico Sundermann, Thomas Thüm, Ina Schaefer

{"title":"Quantifying the variability mismatch between problem and solution space","authors":"Marc Hentze, Chico Sundermann, Thomas Thüm, Ina Schaefer","doi":"10.1145/3550355.3552411","DOIUrl":"https://doi.org/10.1145/3550355.3552411","url":null,"abstract":"A software product line allows to derive individual software products based on a configuration. As the number of configurations is an indicator for the general complexity of a software product line, automatic #SAT analyses have been proposed to provide this information. However, the number of configurations does not need to match the number of derivable products. Due to this mismatch, using the number of configurations to reason about the software complexity (i.e., the number of derivable products) of a software product line can lead to wrong assumptions during implementation and testing. How to compute the actual number of derivable products, however, is unknown. In this paper, we mitigate this problem and present a concept to derive a solution-space feature model which allows to reuse existing #SAT analyses for computing the number of derivable products of a software product line. We apply our concept to a total of 119 subsystems of three industrial software product lines. The results show that the derivation scales for real world software product lines and confirm the mismatch between the number of configurations and the number of products.","PeriodicalId":303547,"journal":{"name":"Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129853695","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}

引用次数: 7

Validating the correctness of reactive systems specifications through systematic exploration 通过系统的探索来验证反应性系统规范的正确性

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552425

Dor Ma'ayan, S. Maoz, Roey Rozi

{"title":"Validating the correctness of reactive systems specifications through systematic exploration","authors":"Dor Ma'ayan, S. Maoz, Roey Rozi","doi":"10.1145/3550355.3552425","DOIUrl":"https://doi.org/10.1145/3550355.3552425","url":null,"abstract":"Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from its temporal logic specification. While the synthesized system is guaranteed to be correct w.r.t. the specification, the specification itself may be incorrect w.r.t. the engineers' intention or w.r.t. the requirements or the environment in which the system should execute in. It thus requires validation. Combinatorial coverage (CC) is a well-known coverage criterion. Its rationale and key for effectiveness is the empirical observation that in many cases, the presence of a defect depends on the interaction between a small number of features of the system at hand. In this work we propose a validation approach for a reactive system specification, based on a systematic combinatorial exploration of the behaviors of a controller that was synthesized from it. Specifically, we present an algorithm to generate and execute a small scenario suite that covers all tuples of given variable value combinations over the reachable states of the controller. We have implemented our work in the Spectra synthesis environment. We evaluated it over benchmarks from the literature using a mutation approach, specifically tailored for evaluating scenario suites of temporal specifications for reactive synthesis. The evaluation shows that for pairwise coverage, our CC algorithms are feasible and provide a 1.7 factor of improvement in mutation score compared to random scenario generation. We further report on a user study with students who have participated in a workshop class at our university and have used our tool to validate their specifications. The user study results demonstrate the potential effectiveness of our work in helping engineers detect real bugs in the specifications they write.","PeriodicalId":303547,"journal":{"name":"Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132761652","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}

引用次数: 1

Bug localization in game software engineering: evolving simulations to locate bugs in software models of video games 游戏软件工程中的Bug定位:在电子游戏软件模型中定位Bug的进化模拟

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552440

Rodrigo Casamayor, Lorena Arcega, Francisca Pérez, Carlos Cetina

{"title":"Bug localization in game software engineering: evolving simulations to locate bugs in software models of video games","authors":"Rodrigo Casamayor, Lorena Arcega, Francisca Pérez, Carlos Cetina","doi":"10.1145/3550355.3552440","DOIUrl":"https://doi.org/10.1145/3550355.3552440","url":null,"abstract":"Video games have characteristics that differentiate their development and maintenance from classic software development and maintenance. These differences have led to the coining of the term Game Software Engineering to name the emerging subfield that intersects Software Engineering and video games. One of these differences is that video game developers perceive more difficulties than other non-game developers when it comes to locating bugs. Our work proposes a novel way to locate bugs in video games by means of evolving simulations. As the baseline, we have chosen BLiMEA, which targets classic software engineering and uses bug reports and the defect localization principle to locate bugs. We also include Random Search as a sanity check in the evaluation. We evaluate the approaches in a commercial video game (Kromaia). The results for F-measure range from 46.80%. to 70.28% for five types of bugs. Our approach improved the results of the baseline by 20.29% in F-measure. To the best of our knowledge, this is the first approach that is designed specifically for bug localization in video games. A focus group with professional video game developers has confirmed the acceptance of our approach. Our approach opens a new research direction for bug localization for both game software engineering and possibly classic software engineering.","PeriodicalId":303547,"journal":{"name":"Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117077590","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}

引用次数: 0

Automatic test amplification for executable models 可执行模型的自动测试放大

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552451

F. Khorram, E. Bousse, Jean-Marie Mottu, G. Sunyé, Pablo Gómez-Abajo, P. Cañizares, E. Guerra, J. de Lara

{"title":"Automatic test amplification for executable models","authors":"F. Khorram, E. Bousse, Jean-Marie Mottu, G. Sunyé, Pablo Gómez-Abajo, P. Cañizares, E. Guerra, J. de Lara","doi":"10.1145/3550355.3552451","DOIUrl":"https://doi.org/10.1145/3550355.3552451","url":null,"abstract":"Behavioral models are important assets that must be thoroughly verified early in the design process. This can be achieved with manually-written test cases that embed carefully hand-picked domain-specific input data. However, such test cases may not always reach the desired level of quality, such as high coverage or being able to localize faults efficiently. Test amplification is an interesting emergent approach to improve a test suite by automatically generating new test cases out of existing manually-written ones. Yet, while ad-hoc test amplification solutions have been proposed for a few programming languages, no solution currently exists for amplifying the test cases of behavioral models. In this paper, we fill this gap with an automated and generic approach. Given an executable DSL, a conforming behavioral model, and an existing test suite, our approach generates new regression test cases in three steps: (i) generating new test inputs by applying a set of generic modifiers on the existing test inputs; (ii) running the model under test with new inputs and generating assertions from the execution traces; and (iii) selecting the new test cases that increase the mutation score. We provide tool support for the approach atop the Eclipse GEMOC Studio1 and show its applicability in an empirical study. In the experiment, we applied the approach to 71 test suites written for models conforming to two different DSLs, and for 67 of the 71 cases, it successfully improved the mutation score between 3.17% and 54.11% depending on the initial setup.","PeriodicalId":303547,"journal":{"name":"Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115911490","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}

引用次数: 2

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552406

Xiaoyu He, Letian Tang, Yutong Li

{"title":"Accelerating similarity-based model matching using on-the-fly similarity preserving hashing","authors":"Xiaoyu He, Letian Tang, Yutong Li","doi":"10.1145/3550355.3552406","DOIUrl":"https://doi.org/10.1145/3550355.3552406","url":null,"abstract":"Similarity-based model matching is the foundation of model versioning. It pairs model elements based on a distance metric (e.g., edit distance). Because it is expensive to calculate the distance between two elements, a similarity-based matcher usually suffers from performance issues when the model size increases. This paper proposes a hash-based approach to accelerate similarity-based model matching. Firstly, we design a novel similarity-preserving hash function that maps a model element to a 64-bit hash value. If two elements are similar, their hashes are also very close. Secondly, we propose a 3-layer index structure and a query algorithm to quickly filter out impossible candidates for the element to be matched based on their hashes. For the remaining candidates, we employ the classical similarity-based matching algorithm to determine the final matches. Our approach has been realized and integrated into EMF Compare. The evaluation results show that our hash function is effective to preserve the similarity between model elements and our matching approach reduces 16%--72% of time costs while assuring the matching results consistent with EMF Compare.","PeriodicalId":303547,"journal":{"name":"Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115333236","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}

引用次数: 0

Precomputing reconfiguration strategies based on stochastic timed game automata 基于随机时间博弈自动机的预计算重构策略

Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems Pub Date : 2022-10-23 DOI: 10.1145/3550355.3552397

Hendrik Göttmann, Birte Caesar, Lasse Beers, Malte Lochau, Andy Schürr, A. Fay

{"title":"Precomputing reconfiguration strategies based on stochastic timed game automata","authors":"Hendrik Göttmann, Birte Caesar, Lasse Beers, Malte Lochau, Andy Schürr, A. Fay","doi":"10.1145/3550355.3552397","DOIUrl":"https://doi.org/10.1145/3550355.3552397","url":null,"abstract":"Many modern software systems continuously reconfigure themselves to (self-)adapt to ever-changing environmental contexts. Selecting presumably best-fitting next configurations is, however, very challenging, depending on functional and non-functional criteria like real-time constraints as well as inherently uncertain future contexts which makes greedy one-step decision heuristics ineffective. In addition, the computational overhead caused by reconfiguration planning at run-time should not outweigh its benefits. On the other hand, completely pre-planning reconfiguration decisions at design time is also infeasible due to the lack of knowledge about the context behavior. In this paper, we propose a game-theoretic setting for precomputing reconfiguration decisions under partially uncertain real-time behavior. We employ stochastic timed game automata as reconfiguration model to derive winning strategies which enable the first player (the system) to make fast look-ups for presumably best-fitting reconfiguration decisions satisfying the second player (the context). To cope with the high computational complexity of finding winning strategies, our tool implementation1 utilizes the statistical model-checker Uppaal Stratego to approximate near-optimal solutions. In our evaluation, we investigate efficiency/effectiveness trade-offs by considering a real-world example consisting of a reconfigurable robot support system for the construction of aircraft fuselages.","PeriodicalId":303547,"journal":{"name":"Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116513794","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}

引用次数: 0