TY - GEN
T1 - Simplification and correctness of UML class diagrams - Focusing on multiplicity and aggregation/composition constraints
AU - Balaban, Mira
AU - Maraee, Azzam
PY - 2013/11/7
Y1 - 2013/11/7
N2 - Model-driven Engineering requires efficient powerful methods for verifying model correctness and quality. Class Diagram is the central language within UML. Its main problems involve correctness problems, which include the consistency and the finite satisfiability problems, and quality problems, which include the redundancy and incomplete design problems. Two central constraints in class diagrams are the multiplicity and the aggregation/composition constraints. They are essential in modeling configuration management, features, biology, computer-aided design and database systems. The contribution of this paper involves efficient algorithms for tightening multiplicity constraints that cannot be realized, and for identification of correctness problems that are caused by aggregation/composition constraints. The algorithms are analyzed, and their soundness and completeness properties are proved. We show that these constraints are inter-related, and that the combination of these algorithms strengthens their results.
AB - Model-driven Engineering requires efficient powerful methods for verifying model correctness and quality. Class Diagram is the central language within UML. Its main problems involve correctness problems, which include the consistency and the finite satisfiability problems, and quality problems, which include the redundancy and incomplete design problems. Two central constraints in class diagrams are the multiplicity and the aggregation/composition constraints. They are essential in modeling configuration management, features, biology, computer-aided design and database systems. The contribution of this paper involves efficient algorithms for tightening multiplicity constraints that cannot be realized, and for identification of correctness problems that are caused by aggregation/composition constraints. The algorithms are analyzed, and their soundness and completeness properties are proved. We show that these constraints are inter-related, and that the combination of these algorithms strengthens their results.
UR - http://www.scopus.com/inward/record.url?scp=84886812398&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-41533-3_28
DO - 10.1007/978-3-642-41533-3_28
M3 - Conference contribution
AN - SCOPUS:84886812398
SN - 9783642415326
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 454
EP - 470
BT - Model-Driven Engineering Languages and Systems - 16th International Conference, MODELS 2013, Proceedings
T2 - 16th ACM/IEEE International Conference on Model Driven Engineering Languages and Systems, MODELS 2013
Y2 - 29 September 2013 through 4 October 2013
ER -