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 are 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balaban, M., Shoval, P.: MEER-An EER Model Enhanced with Structure Methods. Information Systems 27(4) (2002)
Berardi, D., Calvanese, D., Giacomo, D.: Reasoning on UML class diagrams. Artificial Intelligence (2005)
Boufares, F., Bennaceur, H.: Consistency Problems in ER-schemas for Database Systems. Information Sciences, Issue 4 (2004)
Cadoli, M., Calvanese, D., De Giacomo, G., Mancini, T.: Finite Satisfiability of UML Class Diagrams by Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, Springer, Heidelberg (2004)
Calvanese, D., Lenzerini, M.: On the Interaction between ISA and Cardinality Constraints. In: Proc. of the 10th IEEE Int. Conf. on Data Engineering (1994)
Calvanese, D., De Giacomo, G., Lenzerini, M., Nardi, D., Rosati, R.: Description Logic Framework for Information Integration. In: Proceedings of the Sixth International Conference on the Principles of Knowledge Representation and Reasoning (KR’98), pp. 2–13 (1998)
Guizzardi, G., Wagner, G., Guarino, N., van Sinderen, M.: An Ontologically well-Founded Profile for UML Conceptual Models. In: Persson, A., Stirna, J. (eds.) CAiSE 2004. LNCS, vol. 3084, Springer, Heidelberg (2004)
Hartman, S.: Graph Theoretic Methods to Construct Entity-Relationship Databases. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, Springer, Heidelberg (1995)
Hartman, S.: On the Implication Problem for Cardinality Constraints and Functional Dependencies. Ann. Math. Artificial Intelligence (2001)
Hartman, S.: Coping with Inconsistent Constraint Specifications. In: Kunii, H.S., Jajodia, S., Sølvberg, A. (eds.) ER 2001. LNCS, vol. 2224, Springer, Heidelberg (2001)
Hartman, S.: Soft Constraints and Heuristic Constraint Correction in Entity- Relationship Modeling. In: Bertossi, L., Katona, G.O.H., Schewe, K.-D., Thalheim, B. (eds.) Semantics in Databases. LNCS, vol. 2582, Springer, Heidelberg (2003)
Kaneiwa, K., Satoh, S.: Consistency Checking Algorithms for Restricted UML Class Diagrams. In: Proceedings of the Fourth International Symposium on Foundations of Information and Knowledge Systems (2006)
Kozlenkov, A., Zisman, A.: Discovering Recording, and Handling Inconsistencies in Software Specifications. Int. J. of Computer and Information Science 5(2) (2004)
Lange, C., Chaudron, M., Muskens, J.: In Practice: UML Software Architecture and Design Description. IEEE Software 23(2) (2006)
Lenzerini, M., Nobili, P.: On the Satisfiability of Dependency Constraints in Entity-Relationship Schemata. Information Systems 15(4) (1990)
Liang, P.: Formalization of Static and Dynamic UML Using Algebraic. Master’s thesis, University of Brussel (2001)
Maraee, A.: Efficient Methods for Solving Finite Satisfiability Problems in UML class Diagrams. Master’ thesis, Ben-Gurion University of the Negev (2007)
OMG: UML 2.0 Superstructure Specification (2005)
Rumbaugh, J., Jacobson, G., Booch, G.: The Unified Modeling Language Reference Manual Second Edition. Addison Wesley, London, UK (2004)
Thalheim, B.: Entity Relationship Modeling, Foundation of Database Technology. Springer, Heidelberg (2000)
Unhelkar, B.: Verification and Validation for Quality of UML 2.0 Models. Addison-Wesley, London, UK (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Maraee, A., Balaban, M. (2007). Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets. In: Akehurst, D.H., Vogel, R., Paige, R.F. (eds) Model Driven Architecture- Foundations and Applications. ECMDA-FA 2007. Lecture Notes in Computer Science, vol 4530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72901-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-72901-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72900-6
Online ISBN: 978-3-540-72901-3
eBook Packages: Computer ScienceComputer Science (R0)