Reifying Concurrency for Executable Metamodeling

Benoit Combemale 1 Julien Deantoni 2, 3 Matias Ezequiel Vara Larsen 2 Frédéric Mallet 2 Olivier Barais 1 Benoit Baudry 1 Robert France 4
1 TRISKELL - Reliable and efficient component based software engineering
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Current metamodeling techniques can be used to specify the syntax and semantics of domain specific modeling languages (DSMLs). However, there is currently very little support for explicitly specifying concurrency semantics using metamodels. Often, such semantics are provided through implicit concurrency models embedded in the underlying execution environment supported by the language workbench used to implement the DSMLs. The lack of an explicit concurrency model has several drawbacks: it not only prevents from developing a complete understanding of the behavioral semantics, it also prevents development of effective concurrency-aware analysis techniques, and effective techniques for producing semantic variants in the cases where the semantic base has variation points. This work reifies concurrency as a metamodeling facility, leveraging formalization work from the concurrency theory and models of computation (MoC) community. The essential contribution of this paper is a proposed language workbench for binding domain-specific concepts and models of computation through an explicit event structure at the metamodel level. We illustrate these novel metamodeling facilities for designing two variants of a concurrent and timed final state machine, and provide other experiments to validate the scope of our approach.
Type de document :
Communication dans un congrès
Erwig, Martin and Paige, Richard F. and Van Wyk, Eric. SLE - 6th International Conference on Software Language Engineering, Oct 2013, Indianapolis, IN, United States. Springer, 8225, pp.365-384, 2013, Lecture Notes in Computer Science; Software Language Engineering - 6th International Conference, SLE 2013, Indianapolis, IN, USA, October 26-28, 2013. Proceedings. <10.1007/978-3-319-02654-1_20>
Liste complète des métadonnées

https://hal.inria.fr/hal-00850770
Contributeur : Benoit Combemale <>
Soumis le : vendredi 30 août 2013 - 08:55:17
Dernière modification le : vendredi 13 janvier 2017 - 14:16:33

Fichier

sle13-eventdrivenmetamodeling-...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Benoit Combemale, Julien Deantoni, Matias Ezequiel Vara Larsen, Frédéric Mallet, Olivier Barais, et al.. Reifying Concurrency for Executable Metamodeling. Erwig, Martin and Paige, Richard F. and Van Wyk, Eric. SLE - 6th International Conference on Software Language Engineering, Oct 2013, Indianapolis, IN, United States. Springer, 8225, pp.365-384, 2013, Lecture Notes in Computer Science; Software Language Engineering - 6th International Conference, SLE 2013, Indianapolis, IN, USA, October 26-28, 2013. Proceedings. <10.1007/978-3-319-02654-1_20>. <hal-00850770v2>

Partager

Métriques

Consultations de
la notice

875

Téléchargements du document

446