Module interconnection languages
Journal of Systems and Software
Discovering, visualizing, and controlling software structure
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Foundations for the study of software architecture
ACM SIGSOFT Software Engineering Notes
Automated program recognition by graph parsing
Automated program recognition by graph parsing
A Syntactic Theory of Software Architecture
IEEE Transactions on Software Engineering - Special issue on software architecture
Software architecture styles as graph grammars
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
The Java Language Specification
The Java Language Specification
Issues in the Practical Use of Graph Rewriting
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Reasoning in the presence of uncertainty via graph rewriting
Reasoning in the presence of uncertainty via graph rewriting
On the Automatic Recovery of Style-Specific Architectural Relations in Software Systems
Automated Software Engineering
Wins and Losses of Algebraic Transformations of Software Architectures
Proceedings of the 16th IEEE international conference on Automated software engineering
| Hi-index | 0.00 |
Often, software architects impose a particular style on the software systems they design. For large software systems, they would like to ensure that the design continues to conform to this style during the maintenance phase of the software-life cycle.We will assume that the architectural design of a software system is available; for instance, it may have been extracted from the source code of the system using a parser. We will also assume we have a set of stylistic constraints given by the architect. For example, the architect may want to ensure that if a module X is allowed to use a procedure in a module Y, then module Y needs to export that procedure.We define the Style Repair Problem as follows: If the current architectural design does not satisfy a set of stylistic constraints, how can we repair it so that it does? We choose to represent architectural designs as directed graphs; hence, repairing the style of these designs is equivalent to repairing the graph. We show how graph grammars can be used to automatically repair styles, and we show how this provides insight into the problem of style maintenance.