skip to main content
10.1145/1656485.1656486acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmodevvaConference Proceedingsconference-collections
research-article

Finite satisfiability of class diagrams: practical occurrence and scalability of the FiniteSat algorithm

Published:05 October 2009Publication History

ABSTRACT

Models lie at the heart of the emerging Model Driven Development (MDD) approach, in which software is developed by repeated transformations of models. Since models are intended as executable specifications, there is a need to provide correctness management on the model level. The underlying hypothesis of this research is that model level tools should be strengthened, to support model elements in a way that would encourage users to take advantage of their features. Furthermore, model transformations should not neglect the translation of model features. This paper explores the practical relevance of detecting Finite Satisfiability problems on the model level. The frequency of occurrence of Finite Satisfiability problems, and the scalability of the efficient FiniteSat algorithm are studied on a set of synthetic class diagrams, created along designed metrics. The contribution of this work is twofold, first in advancing towards creating a benchmark of class diagrams, and second, in the empirical study of the Finite Satisfiability problem.

References

  1. Berardi, D., Calvanese, D., Giacomo, D.: Reasoning on uml class diagrams. Artificial Intelligence 168 (2005) 70--118 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Lutz, C., Sattler, U., Tendera, L.: The complexity of finite model reasoning in description logics. Inf. Comput. 199 (2005) 132--171 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Maraee, A., Makarenkov, V., Balaban, M.: Efficient recognition and detection of finite satisfiability problems in uml class diagrams: Handling constrained generalization sets, qualifiers and association class constraints. In: 1st International Workshop on "Model co-evolution and consistency management" (MoDELS'08). (2008)Google ScholarGoogle Scholar
  4. Calvanese, D., Lenzerini, M.: On the interaction between isa and cardinality constraints. In: The 10th IEEE Int. Conf. on Data Engineering, Washington, DC, USA, IEEE Computer Society (1994) 204--213 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Lenzerini, M., Nobili, P.: On the satisfiability of dependency constraints in entity-relationship schemata. Information Systems 15(4) (1990) 453--461 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Thalheim, B.: Entity Relationship Modeling, Foundation of Database Technology. Springer-Verlag (2000) Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Maraee, A., Balaban, M.: Efficient reasoning about finite satisfiability of uml class diagrams with constrained generalization sets. In: The 3rd European Conference on Model-Driven Architecture, Springer (2007) 17--31 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Chidamber, Kemerer: A metrics suite for object oriented design. IEEE Transactions on Software Engineering 20 (1994) 476--493 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Kim, H., Boldyreff, C.: Developing software metrics applicable to uml models. In: 6th ECOOP Workshop on Quantitative Approaches in Object-Oriented Software Engineering. (2002)Google ScholarGoogle Scholar
  10. Manso, M. E., Genero, M., Piattini, M.: No-redundant metrics for uml class diagram structural complexity. In: Lecture Notes in Computer Science: Advanced Information Systems Engineering. (2003)Google ScholarGoogle Scholar
  11. Erdos, P., Renyi, A.: On random graphs. In: Publ. Math. Debrecen. Volume 6. (1959) 290--297Google ScholarGoogle Scholar
  12. Gogolla, M., Buttner, F., Richters, M.: Use: A uml-based specification environment for validating uml and ocl. Science of Computer Programming (2007) 69:27--34 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Finite satisfiability of class diagrams: practical occurrence and scalability of the FiniteSat algorithm

                      Recommendations

                      Comments

                      Login options

                      Check if you have access through your login credentials or your institution to get full access on this article.

                      Sign in
                      • Published in

                        cover image ACM Other conferences
                        MoDeVVa '09: Proceedings of the 6th International Workshop on Model-Driven Engineering, Verification and Validation
                        October 2009
                        95 pages
                        ISBN:9781605588766
                        DOI:10.1145/1656485

                        Copyright © 2009 ACM

                        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                        Publisher

                        Association for Computing Machinery

                        New York, NY, United States

                        Publication History

                        • Published: 5 October 2009

                        Permissions

                        Request permissions about this article.

                        Request Permissions

                        Check for updates

                        Qualifiers

                        • research-article

                      PDF Format

                      View or Download as a PDF file.

                      PDF

                      eReader

                      View online with eReader.

                      eReader