A syntactic theory of software architecture

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 fo...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1995-04, Vol.21 (4), p.302-313
Main Authors: Dean, T.R., Cordy, J.R.
Format: Article
Language:English
Subjects:
Applied sciences
Architecture
Computer architecture
Computer science
control theory
systems
Connectors
Councils
Data processing. List processing. Character string processing
Exact sciences and technology
Information science
Information technology
Language
Memory organisation. Data processing
Paradigms
Pattern matching
Semantics
Set theory
Software
Software architecture
Software engineering
Studies
Syntax
Systems design
Taxonomy
Theory
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:0098-5589
1939-3520
DOI:10.1109/32.385969