Ensuring correctness of model transformations while remaining decidable

Abstract

This paper is concerned with the interplay of the expressiveness of model and graph transformation languages,of assertion formalisms making correctness statements about transformations,and the decidability of the resulting verification problems. We put a particular focus on transformations arising in graph-based knowledge bases and model-driven engineering. We then identify requirements that should be satisfied by logics dedicated to reasoning about model transformations,and investigate two promising instances which are decidable fragments of first-order logic.