Introduces 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
%0 Journal Article
%1 dean_syntactic_1995
%A Dean, T. R
%A Cordy, J. R
%D 1995
%J IEEE Transactions on Software Engineering
%K Architecture; Computer Connectors; Councils; Information Pattern Set Software Taxonomy; abstraction; architecture architecture; connections; diagrammatic diagrams; engineering; extensible formal language; languages; matching; nodes; science; software structure; subsystem; syntactic syntax; technology; theory theory; type typed
%N 4
%P 302--313
%R 10.1109/32.385969
%T A syntactic theory of software architecture
%V 21
%X Introduces 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
@article{dean_syntactic_1995,
abstract = {Introduces 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},
added-at = {2013-02-28T11:13:35.000+0100},
author = {Dean, T. R and Cordy, J. R},
biburl = {https://www.bibsonomy.org/bibtex/23e9647e873f463e806a2e8ab87547755/fritzsolms},
doi = {10.1109/32.385969},
interhash = {53c20b9e9df334e2c8d59247cbf09b26},
intrahash = {3e9647e873f463e806a2e8ab87547755},
issn = {0098-5589},
journal = {{IEEE} Transactions on Software Engineering},
keywords = {Architecture; Computer Connectors; Councils; Information Pattern Set Software Taxonomy; abstraction; architecture architecture; connections; diagrammatic diagrams; engineering; extensible formal language; languages; matching; nodes; science; software structure; subsystem; syntactic syntax; technology; theory theory; type typed},
lccn = {0096},
month = apr,
number = 4,
pages = {302--313},
timestamp = {2013-02-28T11:13:45.000+0100},
title = {{A syntactic theory of software architecture}},
volume = 21,
year = 1995
}