Finite model reasoning on UML class diagrams via constraint programming
Finite model reasoning on UML class diagrams via constraint programming
复制标题
DOI：
10.3233/ia-130045
复制
发表时间：
2007-09
期刊：
影响因子：
--
通讯作者：
Marco Cadoli;Diego Calvanese;Giuseppe De Giacomo;Toni Mancini
中科院分区：
文献类型：
--
作者：
Marco Cadoli;Diego Calvanese;Giuseppe De Giacomo;Toni Mancini
在UML类图中的有限模型推理是评估软件应用程序开发中分析阶段质量的一项重要任务，其中假设域中对象的数量是有限的。在本文中，我们将展示如何编码有限模型推理UML类图作为一个约束满足问题（CSP），利用描述逻辑开发的技术。在这样做的时候，我们建立并解决了一个中间CSP问题，以处理在编码中出现的“类组合”的爆炸。为了解决由此产生的CSP问题，我们依赖于使用现成的约束建模和编程工具。其结果是，我们获得，据我们所知，第一个实现的系统，执行有限模型推理的UML类图。
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.