View in EDS PDF Full Text

Enhanced graph rewriting systems for complex software domains.

Saved in:
Bibliographic Details
Title: Enhanced graph rewriting systems for complex software domains.
Authors: Eichler, Cédric ceichler@laas.fr, Monteil, Thierry monteil@laas.fr, Stolf, Patricia stolf@irit.fr, Grieco, Luigi1 alfredo.grieco@poliba.it, Drira, Khalil2 drira@laas.fr
Source: Software & Systems Modeling. Jul2016, Vol. 15 Issue 3, p685-705. 21p.
Subjects: Rewriting systems (Computer science), Computer software, Software architecture, Scalability, Requirements engineering
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. [ABSTRACT FROM AUTHOR]
Copyright of Software & Systems Modeling is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 116774297
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Enhanced graph rewriting systems for complex software domains.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Eichler%2C+Cédric%22">Eichler, Cédric</searchLink><i> ceichler@laas.fr</i><br /><searchLink fieldCode="AR" term="%22Monteil%2C+Thierry%22">Monteil, Thierry</searchLink><i> monteil@laas.fr</i><br /><searchLink fieldCode="AR" term="%22Stolf%2C+Patricia%22">Stolf, Patricia</searchLink><i> stolf@irit.fr</i><br /><searchLink fieldCode="AR" term="%22Grieco%2C+Luigi%22">Grieco, Luigi</searchLink><relatesTo>1</relatesTo><i> alfredo.grieco@poliba.it</i><br /><searchLink fieldCode="AR" term="%22Drira%2C+Khalil%22">Drira, Khalil</searchLink><relatesTo>2</relatesTo><i> drira@laas.fr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Software+%26+Systems+Modeling%22">Software & Systems Modeling</searchLink>. Jul2016, Vol. 15 Issue 3, p685-705. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Rewriting+systems+%28Computer+science%29%22">Rewriting systems (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink><br /><searchLink fieldCode="DE" term="%22Software+architecture%22">Software architecture</searchLink><br /><searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Requirements+engineering%22">Requirements engineering</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Software & Systems Modeling is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=116774297
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10270-014-0433-1
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 685
    Subjects:
      – SubjectFull: Rewriting systems (Computer science)
        Type: general
      – SubjectFull: Computer software
        Type: general
      – SubjectFull: Software architecture
        Type: general
      – SubjectFull: Scalability
        Type: general
      – SubjectFull: Requirements engineering
        Type: general
    Titles:
      – TitleFull: Enhanced graph rewriting systems for complex software domains.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Eichler, Cédric
      – PersonEntity:
          Name:
            NameFull: Monteil, Thierry
      – PersonEntity:
          Name:
            NameFull: Stolf, Patricia
      – PersonEntity:
          Name:
            NameFull: Grieco, Luigi
      – PersonEntity:
          Name:
            NameFull: Drira, Khalil
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 16191366
          Numbering:
            – Type: volume
              Value: 15
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Software & Systems Modeling
              Type: main
ResultId 1