• Calendar

July 31, Tuesday
14:00 – 15:00

First is the FiniteSat algorithm, an efficient detection method for finite satisfiability problems in UML class diagrams. I will sketch the main arguments for its correctness and scope. The algorithm is strengthened by a propagation method for implied missing constraints. Next, I will present an identification method which points to the causes for finite satisfiability problems. > The second contribution of my research deals with analysis of inter-association constraints in UML class diagrams. These constraints although intensively used in the UML meta-model, have obscure and contradictory semantics. The analysis reaches semantic agreements based on constraint observables that minimize meta-model changes. This analysis has yielded recommendations and guidelines for modelers. > The last part of the talk relates to the human factor in modeling. We describe a catalog of anti-patterns that characterize correctness and quality problems in class diagrams. Formalization of the anti-patterns involves a template-oriented extension of the class diagram language. The catalog role was tested in a series of experiments. The novelty of the research lies in the integration of formal and educational methods for improving model design quality in class diagrams.