Constraint-preserving architecture transformations: A graph rewriting approach
- 25 Downloads
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.
Keywordsarchitecture transformation graph rewriting weakest precondition constraint checking
Unable to display preview. Download preview PDF.
- Courcelle B. Graph Rewriting: An Algebraic and Logic Approach. Handbook of Theoretical Computer Science, Chapter 5, Elsevier Science, 1990.Google Scholar
- 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.Google Scholar
- Dijkstra E W. A Discipline of Programming. Prentice-Hall, 1976.Google Scholar
- 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.Google Scholar
- 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.Google Scholar