5 research outputs found
Composing control flow and formula rules for computing on grids
We define computation on grids as the composition, through pushout constructions, of control flows, carried across adjacency relations between grid cells, with formulas updating the value of some attribute. The approach is based on the identification of a subcategory of attributed typed graphs suitable to the definition of pushouts on grids, and is illustrated in the context of the Cyberfilm visual language
Towards the flexible reuse of model transformations: A formal approach based on Graph Transformation
This is the author’s version of a work that was accepted for publication in Journal of Logical and Algebraic Methods in Programming. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Logical and Algebraic Methods in Programming 83.5-6 (2014) , DOI:10.1016/j.jlamp.2014.08.005This special issue of the Journal of Logic and Algebraic Methods in Programming (JLAMP) includes full revised versions of selected papers that were presented at the 24th Nordic Workshop on Programming Theory (NWPT 2012). The workshop took place in Bergen, Norway, during 31 October–2 November 2012 and was organized by the Department of Informatics, University of Bergen, and the Bergen University College.Model transformations are the heart and soul of Model Driven Engineering (MDE). However, in
order to increase the adoption of MDE by industry, techniques for developing model transformations
in the large and raising the quality and productivity in their construction, like reusability,
are still needed.
In previous works, we developed a reutilization approach for graph transformations based
on the definition of concepts, which gather the structural requirements needed by meta-models
to qualify for the transformations. Reusable transformations are typed by concepts, becoming
transformation templates. Transformation templates are instantiated by binding the concept to a
concrete meta-model, inducing a retyping of the transformation for the given meta-model.
This paper extends the approach allowing heterogeneities between the concept and the metamodel,
thus increasing the reuse opportunities of transformation templates. Heterogeneities are
resolved by using algebraic adapters which induce both a retyping and an adaptation of the
transformation. As an alternative, the adapters can also be employed to induce an adaptation of
the meta-model, and in this work we show the conditions for equivalence of both approaches to
transformation reuse.We thank the referees for their detailed comments, which helped to greatly
improve the paper. This work has been supported by the Spanish Ministry of Economy and
Competitivity with project Go-Lite (TIN2011-24139)