A SYNTACTIC THEORY OF SOFTWARE ARCHITECTURE

被引：30
作者：
DEAN, TR
CORDY, JR
机构：
[1] Department of Computing and Information Science, Queen's University at Kingston
来源：
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1995年 / 21卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
SOFTWARE ARCHITECTURE; SOFTWARE STRUCTURE; PATTERN MATCHING;
D O I：
10.1109/32.385969
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：302 / 313
页数：12
相关论文
共 11 条
[1]  
Abowd G., 1993, P 1 ACM SIGSOFT S FD, P9
[2]  
ALLEN R, 1994, 16 INT C SOFTW ENG S, P71
[3]  
ALLEN R, 1992, CMUCS92163 CARN MELL
[4]  
[Anonymous], 1989, Z NOTATION REFERENCE
[5]  
DEAN T, 1993, THESIS QUEENS U KING
[6]  
FAHMY H, 1992, P 11 INT C PATT REC, V2, P294
[7]  
FILLMAN R, 1984, COORDINATED COMPUTIN
[8]   COMMUNICATING SEQUENTIAL PROCESSES [J].
HOARE, CAR .
COMMUNICATIONS OF THE ACM, 1978, 21 (08) :666-677
[9]  
MILNER R, 1980, LECTURE NOTES COMPUT
[10]  
Shaw M., 1993, ADV SOFTWARE ENG KNO, VI, P1
12