Finite satisfiability of UML class diagrams with constrained class hierarchy

Abstract

Gurion University of the Negev Models lie at the heart of the emerging model-driven engineering approach. In order to guarantee precise, consistent, and correct models, there is a need for efficient powerful methods for verifying model correctness. Class diagram is the central language within UML. Its correctness problems involve issues of contradiction, namely the consistency problem, and issues of finite instantiation, namely the finite satisfiability problem.This article analyzes the problem of finite satisfiability of class diagrams with class hierarchy constraints and generalization-set constraints. The article introduces the FiniteSat algorithm for efficient detection of finite satisfiability in such class diagrams, and analyzes its limitations in terms of complex hierarchy structures. FiniteSat is strengthened in two directions. First, an algorithm for identification of the cause for a finite satisfiability problem is introduced. Second, a method for propagation of generalization-set constraints in a class diagram is introduced. The propagation method serves as a preprocessing step that improves FiniteSat performance, and helps developers in clarifying intended constraints. These algorithms are implemented in the FiniteSatUSE tool [BGU Modeling Group 2011b], as part of our ongoing effort for constructing a model-level integrated development environment [BGU Modeling Group 2010a]. ACM Reference Format: Balaban, M. and Maraee, A. 2013. Finite satisfiability of uml class diagrams with constrained class hierarchy.

Smart Bound Selection for the Verification of UML/OCL Class Diagrams

“…There are several proposals in the literature for formalizing UML class diagrams as a CSP [4], [9], [26]. Regarding OCL, CSPs have been used for verification [9], but that formalization is unsuitable for bound tightening.…”

“…Some approaches focus on decidable verification problems either by excluding OCL [6], [26], [36] or by restricting OCL to a decidable subset [37], [38]. Among the methods supporting general OCL constraints, e.g., [20], [39], bounded verification is a popular strategy [9], [10], [11], [13], [14].…”

Augmenting Field Data for Testing Systems Subject to Incremental Requirements Changes

“…Other approaches that rely upon model slicing to improve the performance of constraint solvers exist, but they focus mostly on the slicing of static models for satisfiability purposes (i.e. to verify whether it is possible to create instances of the class diagram without violating any constraint [Shaikh et al 2010;Balaban and Maraee 2013]). The generated slices typically contain a subset of the elements belonging to the static models.…”

Locally Constrained Ontologies

“…The finite model setting considered in Section 12, was explored for UML class diagrams in Balaban and Maraee (2013).…”

“…The finite model setting considered in this Section, was explored for UML class diagrams in Balaban and Maraee (2013). One might object that allowing for infinite models (i.e., infinite databases, see Section 4) makes the results of the paper less interesting.…”