Towards Domain Refinement for UML/OCL Bounded Verification

More Than Two Decades of Research on Verification of UML Class Models: A Systematic Literature Review

“…This study is mainly divided into 3 sub-studies (SS4.1, SS4.2, and SS4.3). The SS4.1 focuses on the work of Cadoli et al [4], [69], SS4.2 presents the work of Pérez et al [70], SS4.3 presents the work of Malgouyres and Motet [5], and SS4.3 compiles the work of Cabot et al [37]- [46].…”

Simplification of UML/OCL schemas for efficient reasoning

“…This is because, at the end, most of these tools relies on some kind of SAT reasoner in its core. For instance, the work by Clarisó et al [28] showed that, by means of analyzing and straightening the number of possible instances every class/association could have (a technique coming from the Constraint Satisfaction Problem literature), they could enhance the response time of a particular UML/OCL reasoning tool by x50. We think that this technique and ours are complementary since we can first, simplify the UML/OCL schema, and then, perform the previous analysis and straightening in the simplified version of it.…”

Verifying the structure and behavior in UML/OCL models using satisfiability solvers

“…For this purpose, a model must be given and problem bounds have to be defined. Those problem bounds can often be derived from the specification but there are also preliminary techniques that automatically extract appropriate problem bounds from a given model [31, 32]. On top of the model and the according problem bounds, a verification task can be formulated and a corresponding symbolic formulation in terms of a bit vector formula is derived.…”