Efficient recognition of finite satisfiability in UML class diagrams: Strengthening by propagation of disjoint constraints

Azzam Maraee, Mira Balaban

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

9 Scopus citations

Abstract

Models lie at the heart of the emerging Model-driven Engineering approach. In order to guarantee precise, consistent and correct models, there is an urgent need for ef ficient reasoning methods for verifYing model correctness. This paper extends and strengthens our previous work on efficient recognition of finite satisfiability problems in UML class diagrams with constrained generalization sets. First, algorithm FiniteSat is simplified into a single stage process, yielding a more compact linear inequality system. The main contribution of the paper is a method for propagation of disjoint constraints within complex class hierarchy structures, which meaningfully extends the scope of the FiniteSat algorithm. The method relies on a thorough analysis of the interaction between disjoint constraints and the structure of class hierarchy. It is recommended as a pre-processing stage, and being an anytime algorithm, even partial application is useful.

Original languageEnglish
Title of host publicationInternational Conference on Model-Based Systems Engineering, MBSE 2009
DOIs
StatePublished - 25 Sep 2009
EventInternational Conference on Model-Based Systems Engineering, MBSE 2009 - Herzeliya and Haifa, Israel
Duration: 2 Mar 20095 Mar 2009

Publication series

NameInternational Conference on Model-Based Systems Engineering, MBSE 2009

Conference

ConferenceInternational Conference on Model-Based Systems Engineering, MBSE 2009
Country/TerritoryIsrael
CityHerzeliya and Haifa
Period2/03/095/03/09

Fingerprint

Dive into the research topics of 'Efficient recognition of finite satisfiability in UML class diagrams: Strengthening by propagation of disjoint constraints'. Together they form a unique fingerprint.

Cite this