Backwards reasoning for model transformations: Method and applications

•We describe a method to compute weakest pre-conditions for model transformations (MT).•The condition to be advanced—the post-condition—is described in OCL.•A pre-condition holds before applying the MT iff the post-condition holds afterwards.•The method enables a wide set of analysis mechanisms, based on backwards reasoning.•These include derivation of application conditions, V&V, MT testing and diagnosis.

Model transformations are key elements of model driven engineering. Current challenges for transformation languages include improving usability (i.e., succinct means to express the transformation intent) and devising powerful analysis methods.In this paper, we show how backwards reasoning helps in both respects. The reasoning is based on a method that, given an OCL expression and a transformation rule, calculates a constraint that is satisfiable before the rule application if and only if the original OCL expression is satisfiable afterwards.With this method we can improve the usability of the rule execution process by automatically deriving suitable application conditions for a rule (or rule sequence) to guarantee that applying that rule does not break any integrity constraint (e.g. meta-model constraints). When combined with model finders, this method facilitates the validation, verification, testing and diagnosis of transformations, and we show several applications for both in-place and exogenous transformations.