Papers by M. Hassenforder
A Calculus for (Meta)Models and Transformations
International Journal of Software Engineering and Knowledge Engineering, 2014
ABSTRACT This paper proposes a formal representation of modeling languages based on category theo... more ABSTRACT This paper proposes a formal representation of modeling languages based on category theory. These languages are generally described by "metamodels", i.e. structures composed by classes and relations, and related by "transformations". Thus, this paper studies how the key categorical concepts such as functors and relations between functors (called natural transformations) can be used for equational reasoning about modeling artifacts (models, metamodels, transformations). As a result, this paper proposes a formal point of view of models usable to specify/prove equivalence between models or transformations (with an application to refactoring).
Model Evolution Leads by Users Interactions
An ontology represents a consensus on the representation of the concepts and axioms of a given do... more An ontology represents a consensus on the representation of the concepts and axioms of a given domain. This consensus is often reached through an iterative process, each iteration consisting in modifying the current version of the consensus. Furthermore, frequent and continuous changes are also occurring when the represented domain evolves or when new requirements have to be considered. Consequently, ontologies have to be adaptable to handle evolution, revision and refinement. However, this process is highly challenging as it is often difficult to understand all affected ontology parts when changes are performed. Thus, inconsistencies can occur in the ontology as the changes can introduce contradictory axioms. To address this issue, this paper presents a formal approach for evolving ontologies using Typed Graph Grammars. This method relies on the algebraic approach Simple PushOut (SPO) of graph transformations. It formalizes the ontology changes and proposes an a priori approach of inconsistencies resolution. The modified ontology does not need an explicit checking as an incorrect ontology version cannot actually be generated. To validate our proposal, an implementation is presented using the Attributed Graph Grammar (AGG) toolbox. (M. Mahfoudh), germain.forest-ier@uha.fr (G. Forestier), laurent.thiry@uha.fr (L. Thiry), michel.hassenforder@uha.fr (M. Hassenforder). 1 bioportal.bioontology.org/ontologies. 2 geneontology.org/ontology-archive. Knowledge-Based Systems 73 (2015) 212-226
Adaptation consistante d’ontologies à l’aide des grammaires de graphes
Comment fusionner des ontologies avec la réécriture de graphes?
Proceedings of the 19th IFAC World Congress, 2014
Modeling complex systems, such as the ones found in the certification of fire protection systems,... more Modeling complex systems, such as the ones found in the certification of fire protection systems, generally requires the intervention of many specialists, each one using its own formalisms, concepts and tools. To model such systems, many specific languages are required and to be integrated they should be formally described. In this proposal, we suggest to use functional programming concepts to formalize and integrate the languages involved in the field of fire safety systems. Formalization is done by specifying constructor functions and integration by the way of generic/higher-order functions.
Software & Systems Modeling, 2008
Meta-modeling is raising more and more interest in the field of language engineering. While this ... more Meta-modeling is raising more and more interest in the field of language engineering. While this approach is now well understood for defining abstract syntaxes, formally defining textual concrete syntaxes with meta-models is still a challenge. Textual concrete syntaxes are traditionally expressed with rules, conforming to EBNF-like grammars, which can be processed by compiler compilers to generate parsers. Unfortunately, these generated parsers produce concrete syntax trees, leaving a gap with the abstract syntax defined by meta-models, and further ad hoc hand-coding is required. In this paper we propose a new kind of specification for concrete syntaxes, which takes advantage of meta-models to generate fully operational tools (such as parsers or text generators). The principle is to map abstract syntaxes to Communicated by Prof. Oscar Nierstrasz.
In this paper we report on our experience using HUTN as a bridge between ModelWare and GrammarWar... more In this paper we report on our experience using HUTN as a bridge between ModelWare and GrammarWare, to generate parsers and editors for DSLs defined under the shape of metamodels. We describe the problems that we have encountered with the ambiguities of the current HUTN specification and discuss how this specification may be fixed to be usable with grammardriven tools.
Lecteur de codes à barres : approche matérielle et logicielle unifiée
J3eA, 2005
ABSTRACT
Uploads
Papers by M. Hassenforder