a_syntactic_theory_of_software_architecture
Differences
This shows you the differences between two versions of the page.
| Next revision Both sides next revision | |||
|
a_syntactic_theory_of_software_architecture [2013/09/06 14:06] yann created |
a_syntactic_theory_of_software_architecture [2013/09/06 14:08] yann |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Abstract ====== | ====== Abstract ====== | ||
| + | |||
| + | 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. | ||
| + | |||
| + | ====== Comments ====== | ||
| + | //Yann-Gaël Guéhéneuc, 2013/09/06// | ||
| + | |||
a_syntactic_theory_of_software_architecture.txt · Last modified: 2019/10/06 20:37 (external edit)
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
