Louis Féraud

  • Citations Per Year
Learn More
.................................................................................................................................................11 Chapitre 1 ..............................................................................................................................................13 Tendances et défis d’une nouvelle génération de(More)
Almost a decade has passed since the OMG has issued the Model Driven Architecture (MDA) initiative. It soon became obvious that raising the level of abstraction in development and reasoning at the model level would help in asking the right questions at the right time. Based on a concrete problem, we discuss four alternative solutions to a multi-language(More)
Graph grammars have been introduced in the late 1970s [1], then they have been significantly improved up to the 2000s [2]. A lot of significant results are due to H. Ehrig and his colleagues who have conceived an algebraic approach to graph rewriting by the means of category theory [1]. It opened the way to computations with attributes. In this approach,(More)
One of the challenges of attributed graph rewriting systems concerns the implementation of attribute computations. Most of the existing systems adopt the standard algebraic approach where graphs are attributed using sigma-algebras. However, for the sake of efficiency considerations and convenient uses, these systems do not generally implement the whole(More)
This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of typed λ -calculus with inductive types. In this paper we present solutions to cope with single pushout construction for the(More)