Validating uml models and ocl constraints
We have considered the static structure diagram that describes the structure of a system, modeled as a UML class diagram.
Complex integrity constraints will be expressed in OCL.
Verification of UML/OCL class diagrams is a quite challenging task when the input is large (i.e., a complex UML/OCL class diagram).
In this paper, we present (1) a benchmark for UML/OCL verification and validation tools, (2) an evaluation and analysis of tools available for verification and validation of UML/OCL class diagrams including the range of UML support for each tool, (3) the problems with efficiency of the verification process for UML/OCL class diagrams, and (4) solution for efficient verification of complex class diagrams.
In this context, the fundamental correctness property of a model is satisfiability.
We focus our discussion on the verification of a specific property: satisfiability—“is it possible to create objects without violating any constraints.?
Therefore, verification of these class diagrams is essential in order to generate accurate transformations.
” The property is relevant in the sense that many interesting properties; for example, redundancy of an integrity constraint can be expressed in terms of satisfiability .
Two different notions of satisfiability can be checked, either weak satisfiability or strong satisfiability.
Furthermore, the addition of unrestricted (Some approaches restrict the set of supported OCL constructs, e.g., to make the verification decidable.
In this paper, we consider general OCL constraints with no limitations on their expressivity.) OCL constraints makes the problem undecidable.
But, I hope they may serve as a useful introduction to the value of OCL in the Eclipse modeling universe, as well as OCL-related transformation languages that I included in my OCL introduction talk.