Affiliations: Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Roma, Italy | Faculty of Computer Science, Free University of Bozen-Bolzano, Bolzano, Italy
Note: [] Marco Cadoli, 1965-2006. Corresponding author: Marco Cadoli, Dip. di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Ariosto 25, 00185 Roma, Italy. E-mails: [email protected] (Marco Cadoli); [email protected] (Giuseppe De Giacomo); [email protected] (Toni Mancini); [email protected] (Diego Calvanese).
Abstract: 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.
