Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract) - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract)

(1) , (1) , (2, 3) , (4) , (1)
1
2
3
4

Abstract

Methodologies for correct by construction reconfigu-rations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non functional perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and their related dependencies. In order to lift these restrictions, an extension to graph rewriting systems is proposed herein. The suitability of this approach, as well as the restraints of currently available ones, are illustrated, analysed and experimentally evaluated with reference to a concrete example. This investigation demonstrates that the conceived solution can: (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; (v) guarantee theoretical properties of a grammar, like its termination. This is an extended abstract for the Models 2015 Conference of the journal paper of the same name [1]. I. MOTIVATION Dynamic software architectures enable adaptation in evolving distributed systems. A crucial undesirable implication of such adaptations is a potential loss of correctness, the system withdrawing from its scope of consistency. Besides correctness, the system has evolving non-functional requirements, which are tightly linked to its appropriateness or efficiency. The satisfaction of these objectives depends on the properties of the system, its components, and their relations. On one hand, graph-based models are appropriate for the design of adaptation rules that necessarily preserve the system's consistency. On the other, currently available graph based methods exhibit limitations with regard to the description of system properties, in particular regarding their evolution and inter-dependencies.
Fichier principal
Vignette du fichier
artSoSym.pdf (62.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01228299 , version 1 (08-01-2016)

Identifiers

  • HAL Id : hal-01228299 , version 1

Cite

Cédric Eichler, Thierry Monteil, Patricia Stolf, Alfredo Grieco, Khalil Drira. Enhanced Graph Rewriting Systems for Complex Software Domains (SoSyM Abstract). International Conference on Model Driven Engineering Languages and Systems (MODELS), Sep 2015, Ottawa, Canada. ⟨hal-01228299⟩
219 View
91 Download

Share

Gmail Facebook Twitter LinkedIn More