Issue No. 07 - July (1998 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.708567
<p><b>Abstract</b>—We believe that software architectures should provide an appropriate basis for the proof of properties of large software. This goal can be achieved through a clearcut separation between computation and communication and a formal definition of the interactions between individual components. We present a formalism for the definition of software architectures in terms of graphs. Nodes represent the individual agents and edges define their interconnection. Individual agents can communicate only along the links specified by the architecture. The dynamic evolution of an architecture is defined independently by a "coordinator." An architecture style is a class of architectures specified by a graph grammar. The class characterizes a set of architectures sharing a common communication pattern. The rules of the coordinator are statically checked to ensure that they preserve the constraints imposed by the architecture style.</p>
Coordination, graph rewriting, software architecture, static verification, views, refinement.
D. Le Métayer, "Describing Software Architecture Styles Using Graph Grammars," in IEEE Transactions on Software Engineering, vol. 24, no. , pp. 521-533, 1998.