Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Constraint-preserving architecture transformations: A graph rewriting approach

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Architecture transformations are frequently performed during software design and maintenance. However this activity is not well supported at a sufficiently abstract level. In this paper, the authors characterize architecture transformations using graph rewriting rules, where architectures are represented in graph notations. Architectures are usually required to satisfy certain constraints during evolution. Therefore a way is presented to construct the sufficient and necessary condition for a transformation to preserve a constraint. The condition can be verified before the application of the transformation. Validated transformations are guaranteed not to violate corresponding constraints whenever applied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Courcelle B. Graph Rewriting: An Algebraic and Logic Approach. Handbook of Theoretical Computer Science, Chapter 5, Elsevier Science, 1990.

  2. Raoult J-C, Voisin F. Set-theoretic graph rewriting. InProceedings of the International Workshop on Graph Transformations in Computer Science, Lecture Notes in Computer Science 776, Springer-Verlag, 1993.

  3. Dijkstra E W. A Discipline of Programming. Prentice-Hall, 1976.

  4. D Le Métayer. Describing software architecture styles using graph grammars.IEEE Transactions on Software Engineering, 1998, 24(7): 521–533.

    Article  Google Scholar 

  5. Inverardi P, Wolf A L. Formal specification and analysis of software architectures using the chemical abstract machine model.IEEE Transactions on Software Engineering, 1995, 21(4): 373–386.

    Article  Google Scholar 

  6. Fahmy H, Holt R C. Using graph rewriting to specify software architectural transformations. InProceedings of Automated Software Engineering (ASE 2000), Grenoble, France, 2000, pp.187–196.

  7. Yuan C, Chen Y. Software architecture evolution by multiset transformation. InProceedings of the International Conference on Software: Theory and Practice (ICS 2000), The 16th IFIP World Computer Congress, Beijing, China, 2000, pp.236–243.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, University of Science and Technology of China, 230027, Hefei, P.R. China

    Yuan Chun & Chen Yiun

Authors
  1. Yuan Chun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chen Yiun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuan Chun.

Additional information

This work was supported by the National Natural Science Foundation of China (No.69773025) and Ph.D. Foundation of the Ministry of Education of China (No.98035828).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuan, C., Chen, Y. Constraint-preserving architecture transformations: A graph rewriting approach. J. Comput. Sci. & Technol. 16, 590–594 (2001). https://doi.org/10.1007/BF02943244

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943244

Keywords

Search

Navigation