Automating Proofs of Partially Ordered Model Transformations

This report discusses the feasibility of automating the proofs of transformations between partially ordered models. It extends the work of the author’s initial report [12] on model transformations with constructive type theory, by formalising a model as a partial order over classes, and a model transformation as a nested set of pre and post-conditions. This opens up the proofs of common kinds of model transformations to analysis and possible automation. The design of a tool for generating proofs is also discussed. This research is being done in the Predictive Assembly Laboratory (PALab) group at King’s College, London, under the supervision of Dr. Iman Poernomo.