User Tools

Site Tools


This is an old revision of the document!


In this paper we 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.


Yann-Gaël Guéhéneuc, 2013/09/06

a_syntactic_theory_of_software_architecture.1378476522.txt.gz · Last modified: 2019/10/06 20:37 (external edit)