Paper Info
Title
Enhanced graph rewriting systems for complex software domains (SoSyM abstract)
Abstract
Methodologies for correct by construction reconfigurations 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, is illustrated, analyzed, 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; and (v) guarantee theoretical properties of a grammar, like its termination.
Year
DOI
Venue
2015
10.1007/s10270-014-0433-1
SOFTWARE AND SYSTEMS MODELING
Keywords
Field
DocType
Constrained and attributed rewriting systems,Graph rewriting systems,Non-functional requirements,Dynamic software architecture,Correctness by construction
Non functional,Programming language,Algebraic number,Systems engineering,Computer science,Theoretical computer science,Grammar,Software,Graph rewriting,Software architecture,Management system,Scalability
Conference
Volume
Issue
ISSN
15.0
3.0
1619-1366
Citations 
PageRank 
References 
1
0.35
0
Authors
5
Name
Order
Citations
PageRank
Cedric Eichler163.53
Thierry Monteil216726.54
Patricia Stolf312517.37
Luigi Alfredo Grieco41852104.72
Khalil Drira548182.48