{"title":"OCL2MSFOL: a mapping to many-sorted first-order logic for efficiently checking the satisfiability of OCL constraints","authors":"Carolina Dania, M. Clavel","doi":"10.1145/2976767.2976774","DOIUrl":null,"url":null,"abstract":"In this paper we propose a mapping from OCL to many-sorted first-order logic, called OCL2MSFOL. This new mapping significantly improves our previous results in two key aspects. First, it accepts as input a larger subset of the UML/OCL language; in particular, it supports UML generalization, along with generalization-related OCL operators. Secondly, it generates as output a class of satisfiability problems that can be efficiently handled by SMT solvers with finite model finding capabilities. We report on a non-trivial case study and draw comparisons with related tools.","PeriodicalId":179690,"journal":{"name":"Proceedings of the ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2976767.2976774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
Abstract
In this paper we propose a mapping from OCL to many-sorted first-order logic, called OCL2MSFOL. This new mapping significantly improves our previous results in two key aspects. First, it accepts as input a larger subset of the UML/OCL language; in particular, it supports UML generalization, along with generalization-related OCL operators. Secondly, it generates as output a class of satisfiability problems that can be efficiently handled by SMT solvers with finite model finding capabilities. We report on a non-trivial case study and draw comparisons with related tools.