Uncovering architectural mismatch in component behavior

被引:34
作者
Compare, D
Inverardi, P [1 ]
Wolf, AL
机构
[1] Univ Aquila, Dipartimento Matemat Pura & Applicata, I-67010 Laquila, Italy
[2] Univ Colorado, Dept Comp Sci, Boulder, CO 80309 USA
关键词
D O I
10.1016/S0167-6423(98)00006-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
When constructing software systems from existing components, the engineer is faced with the problem of potential conflicts in the interactions among the components. Of particular difficulty is guaranteeing compatibility in the dynamic interaction behavior. Using an architectural description of the system and its intended components, the engineer can reason about the interactions early and at a high level of abstraction. In this paper we give a case study of the Compressing Proxy system, which was first investigated by Garlan, Kindred, and Wing. We present architectural specifications and analyses of two versions of the system. One version is a seemingly obvious melding of the components. The other is a solution to deadlock problems uncovered by formal analyses of the first version. We use the Chemical Abstract Machine as an example of an architectural description formalism that can help uncover architectural mismatches in the behavior of components. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:101 / 131
页数:31
相关论文
共 24 条
[1]  
Abowd G. D., 1995, ACM Transactions on Software Engineering and Methodology, V4, P319, DOI 10.1145/226241.226244
[2]  
Allen R., 1997, ACM Transactions on Software Engineering and Methodology, V6, P213, DOI 10.1145/258077.258078
[3]   PROGRAMMING BY MULTISET TRANSFORMATION [J].
BANATRE, JP ;
LEMETAYER, D .
COMMUNICATIONS OF THE ACM, 1993, 36 (01) :98-111
[4]   THE GAMMA MODEL AND ITS DISCIPLINE OF PROGRAMMING [J].
BANATRE, JP ;
LEMETAYER, D .
SCIENCE OF COMPUTER PROGRAMMING, 1990, 15 (01) :55-77
[5]   THE CHEMICAL ABSTRACT MACHINE [J].
BERRY, G ;
BOUDOL, G .
THEORETICAL COMPUTER SCIENCE, 1992, 96 (01) :217-248
[6]  
BOUDOL G, 1994, LNCS, V0803, P00092, DOI DOI 10.1007/3-540-58043-3
[7]  
COMPARE D, 1996, LECT NOTES COMPUTER, V1061, P428
[8]  
COMPARE D, 1995, SPECIFICA ANAL CERN
[9]  
CORRADINI F, 1998, CHOICE SOFTWARE ARCH
[10]   PROVING FINITENESS OF CCS PROCESSES BY NONSTANDARD SEMANTICS [J].
DEFRANCESCO, N ;
INVERARDI, P .
ACTA INFORMATICA, 1994, 31 (01) :55-80