Reasoning on UML class diagrams

被引:271
|
作者
Berardi, D
Calvanese, D
De Giacomo, G
机构
[1] Univ Roma La Sapienza, Dipartimento Informat & Sistemist, I-00198 Rome, Italy
[2] Free Univ Bolzano Bozen, Fac Comp Sci, I-39100 Bolzano, Italy
关键词
knowledge representation; description logics; UML class diagrams; computational complexity; verification; CASE tools;
D O I
10.1016/j.artint.2005.05.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
UML is the de-facto standard formalism for software design and analysis. To support the design of large-scale industrial applications, sophisticated CASE tools are available on the market, that provide a user-friendly environment for editing, storing, and accessing multiple UNIL diagrams. It would be highly desirable to equip such CASE tools with automated reasoning capabilities, such as those studied in Artificial Intelligence and, in particular, in Knowledge Representation and Reasoning. Such capabilities would allow to automatically detect relevant formal properties of UML diagrams, such as inconsistencies or redundancies. With regard to this issue, we consider UML class diagrams, which are one of the most important components of UML, and we address the problem of reasoning on such diagrams. We resort to several results developed in the field of Knowledge Representation and Reasoning, regarding Description Logics (DLs), a family of logics that admit decidable reasoning procedures. Our first contribution is to show that reasoning on UML class diagrams is EXPTIME-hard, even under restrictive assumptions; we prove this result by showing a polynomial reduction from reasoning in DLs. The second contribution consists in establishing EXPTIME-membership of reasoning on UML class diagrams, provided that the use of arbitrary OCL (first-order) constraints is disallowed. We get this result by using DLRifd, a very expressive EXPTIME-decidable DL that has been developed to capture typical features of conceptual and object-oriented data models. ne last contribution has a more practical flavor, and consists in a polynomial encoding of UML class diagrams in the DL ALCQI, which essentially is the most expressive DL supported by current state-of-the-art DL-based reasoning systems. Though less expressive than DLRifd, the DL ALC QI preserves enough semantics to keep reasoning about UML class diagrams sound and complete. Exploiting such an encoding, one can use current DL-based reasoning systems as core reasoning engines for a next generation of CASE tools, that are equipped with reasoning capabilities on UML class diagrams. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:70 / 118
页数:49
相关论文
共 50 条
  • [1] Reasoning with UML class diagrams
    Evans, AS
    [J]. 2ND IEEE WORKSHOP ON INDUSTRIAL STRENGTH FORMAL SPECIFICATION TECHNIQUES - PROCEEDINGS, 1999, : 102 - 113
  • [2] Reasoning on UML class diagrams with OCL constraints
    Queralt, Anna
    Teniente, Ernest
    [J]. CONCEPTUAL MODELING - ER 2006, PROCEEDINGS, 2006, 4215 : 497 - +
  • [3] A formal framework for reasoning on UML class diagrams
    Calì, A
    Calvanese, D
    De Giacomo, G
    Lenzerini, M
    [J]. FOUNDATIONS OF INTELLIGENT SYSTEMS, PROCEEDINGS, 2002, 2366 : 503 - 513
  • [4] Finite model reasoning on UML class diagrams via constraint programming
    Cadoli, Marco
    Calvanese, Diego
    De Giacomo, Giuseppe
    Mancini, Toni
    [J]. AI(ASTERISK)IA 2007: ARTIFICIAL INTELLIGENCE AND HUMAN-ORIENTED COMPUTING, 2007, 4733 : 36 - +
  • [5] Optimizing UML Class Diagrams
    Sergievskiy, Maxim
    Kirpichnikova, Ksenia
    [J]. 7TH SEMINAR ON INDUSTRIAL CONTROL SYSTEMS: ANALYSIS, MODELING AND COMPUTING (ICS 2018), 2018, 18
  • [6] Querying UML Class Diagrams
    Cali, Andrea
    Gottlob, Georg
    Orsi, Giorgio
    Pieris, Andreas
    [J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, FOSSACS 2012, 2012, 7213 : 1 - 25
  • [7] Reduction of UML class diagrams
    Linde, G
    [J]. DATABASES AND INFORMATION SYSTEMS II, 2002, : 199 - 208
  • [8] Formalization of the UML Class Diagrams
    Osis, Janis
    Donins, Uldis
    [J]. EVALUATION OF NOVEL APPROACHES TO SOFTWARE ENGINEERING, 2010, 69 : 180 - 192
  • [9] Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets
    Maraee, Azzam
    Balaban, Mira
    [J]. MODEL DRIVEN ARCHITECTURE - FOUNDATIONS AND APPLICATIONS, 2007, 4530 : 17 - +
  • [10] Reasoning about UML/OCL class diagrams using constraint logic programming and formula
    Perez, Beatriz
    Porres, Ivan
    [J]. INFORMATION SYSTEMS, 2019, 81 : 152 - 177