Clustering of model instances by using graph kernels. Make sure you test your models with the most diverse set of examples!
Defining the right constraints for any system is a challenging task that risks over-constraining or under-constraining the data. Our method helps designers to find the proper constraints by automatically mutating them to fit the sample data
We propose to employ graph kernels for clustering software modeling artifacts. Among other benefits, this would improve the efficiency and usability of a variety of software modeling activities, e.g., design space exploration, testing or verification and validation.
Correctness of UML diagrams annotated with OCL constraints can be checked using bounded verification. We show an automatic technique to choose the best bounds