Issue No.04 - April (1995 vol.21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.385969
In this paper we introduce a general, extensible diagrammatic syntax for expressing software architectures based on typed nodes and connections and formalized using set theory. The syntax provides a notion of abstraction corresponding to the concept of a subsystem, and exploits this notion in a general mechanism for pattern matching over architectures. We demonstrate these ideas using a small example architecture language with a limited number of types of nodes and connectors, and a small taxonomy of architectures characterized as sets of patterns in the language.
Software architecture, software structure, pattern matching
Thomas R. Dean, "A Syntactic Theory of Software Architecture", IEEE Transactions on Software Engineering, vol.21, no. 4, pp. 302-313, April 1995, doi:10.1109/32.385969