OCL2MSFOL: a mapping to many-sorted first-order logic for efficiently checking the satisfiability of OCL constraints

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.