A minimum cardinality consistency-checking algorithm for UML class diagrams

  • Authors:

  • S. Salunkhe Satish;S. Radke Shashikant;V. K. Sambhe;Rahul B. Shelke;Ganesh Kocharekar

  • Affiliations:

  • SFIT, Mumbai University, India;VJTI, Matunga, Mumbai, India;VJTI, Matunga, Mumbai, India;VJTI, Matunga, Mumbai, India;VJTI, Matunga, Mumbai, India

  • Venue:
  • Proceedings of the International Conference and Workshop on Emerging Trends in Technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Design inconsistencies are either implemented as faults in a system or, if caught by the programmer, provide ambiguous rules on which the programmer must base a system decision. Any tool, which can isolate inconsistencies during the design process, may have value. This paper presents an algorithm for checking the consistency of minimum cardinalities in a Unified Modeling Language (UML) class diagram by dividing the diagram into subgraphs. A cardinality is inconsistent if it can have differing values within the same subgraph. A class diagram is more likely to contain this type of fault if it contains a circuit. While UML class diagrams do not require that cardinalities be expressly identified, it is possible to use this algorithm on all types of UML relations, including those with some standard constraints, and perform consistency checking on the implied minimum cardinalities.