Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets

Azzam Maraee, Mira Balaban

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

28 Scopus citations

Abstract

UML class diagrams play a central role in the design and specification of software, databases and ontologies. The model driven architecture approach emphasizes the central role that models play, towards achieving reliable software. It is important that models aire correct and that problems are detected as early as possible in the software design process. However, current case tools do not support reasoning tasks about class diagrams and enable the construction of erroneous models. There is an urgent need for methods for detecting analysis and design problems. In this paper, we present a linear programming based method for reasoning about finite satisfiability of UML class diagrams with constrained generalization sets. The method is simple and efficient and can be easily added to a case tool. It improves over existing methods that require exponential resources and extends them to new elements of class diagrams.

Original languageEnglish
Title of host publicationModel Driven Architecture - Foundations and Applications
Subtitle of host publicationThird European Conference, ECMDA-FA 2007, Proceedings
PublisherSpringer Verlag
Pages17-31
Number of pages15
ISBN (Print)3540729003, 9783540729006
DOIs
StatePublished - 1 Jan 2007
Event3rd European Conference on Model-Driven Architecture - Foundations and Applications, ECMDA-FA 2007 - Haifa, Israel
Duration: 11 Jun 200715 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4530 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd European Conference on Model-Driven Architecture - Foundations and Applications, ECMDA-FA 2007
Country/TerritoryIsrael
CityHaifa
Period11/06/0715/06/07

Keywords

  • Cardinality constraints
  • Class hierarchy structure
  • Consistency
  • Finite satisfiability
  • Generalization set constraints
  • Reasoning about class diagram
  • UML class diagram

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Efficient reasoning about finite satisfiability of UML class diagrams with constrained generalization sets'. Together they form a unique fingerprint.

Cite this