Scientific journal paper
Finite satisfiability verification in UML class diagrams: a comparative study
Paulo R. Carvalho Bastos (Bastos, P.); Pedro Ramos (Ramos, P.);
Journal Title
IADIS: International Journal on Computer Science and Information Systems
Year (definitive publication)
2013
Language
English
Country
Portugal
More Information
Web of Science®

Times Cited: 0

(Last checked: 2024-05-17 18:50)

View record in Web of Science®

Scopus

This publication is not indexed in Scopus

Google Scholar

Times Cited: 2

(Last checked: 2024-05-13 07:16)

View record in Google Scholar

Abstract
Unified Modeling Language class diagrams are widely used for modeling, playing a key role in the analysis and design of information systems, especially in development contexts that use modeling oriented methodologies. Therefore, it is relevant to ensure the creation and maintenance of correct class diagrams. With the use of class diagrams it is possible to specify classes, relations and restrictions, however, such diagrams are subject to modeling errors made by their authors and may degenerate into incorrect diagrams. A common cause of incorrect diagrams refers to the definition of contradictory and inconsistent constraints, leading to finite satisfiability problems. Several approaches to the verification of finite satisfiability are currently available, supported by different tools. Through this work, we proceed with the identification and comparison of the existing approaches for the verification of finite satisfiability in class diagrams, determining the effectiveness and efficiency of the proposed tools.
Acknowledgements
--
Keywords
Finite satisfiability, Class diagrams, Unified Modeling Language