On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
The Unified Modeling Language user guide
The Unified Modeling Language user guide
The OPL optimization programming language
The OPL optimization programming language
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Description logics for databases
The description logic handbook
Reasoning on UML class diagrams
Artificial Intelligence
Decidable Reasoning in UML Schemas with Constraints
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
OCL-Lite: Finite reasoning on UML/OCL conceptual schemas
Data & Knowledge Engineering
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Management of Correctness Problems in UML Class Diagrams Towards a Pattern-Based Approach
International Journal of Information System Modeling and Design
Towards a generic verification methodology for system models
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
Finite model reasoning in UML class diagrams is an important task for assessing the quality of the analysis phase in the development of software applications in which it is assumed that the number of objects of the domain is finite. In this paper, we show how to encode finite model reasoning in UML class diagrams as a constraint satisfaction problem (CSP), exploiting techniques developed in description logics. In doing so we set up and solve an intermediate CSP problem to deal with the explosion of "class combinations" arising in the encoding. To solve the resulting CSP problems we rely on the use of off-the-shelf tools for constraint modeling and programming. As a result, we obtain, to the best of our knowledge, the first implemented system that performs finite model reasoning on UML class diagrams.