Efficient Recognition and Detection of Finite Satisfiability in UML Class Diagrams

• Project number: 202-08-11
• Students: Victor Makarenkov, Azzam Maraee
• Supervisor: Mira Balaban

Models lie at the heart of the emerging Model-driven Engineering approach. In order to guarantee precise, consistent and correct models, there is an urgent need for efficient methods for verifying model correctness. Class diagrams are the most important UML model. Finite Satisfiability of class diagrams characterizes the ability to finitely instantiate the classes of a class diagram, without violating any constraint.

Our work concentrates on efficient recognition of finite satisfiability problems in UML class diagrams. The main obstacle lies in the various constraints that class diagrams include.

Our method handles the following constraints: * Class hierarchy constraints. * Generalization set constraints. * Qualifier constraints. * Association class constraints.

We also have a method for detection of the constraints that cause finite satisfiability.