Uncovering architectural mismatch in component behavior

Science of Computer Programming

Volumn 33, Issue 2, 1999, Pages 101-131

  Compare, Daniele ^a   Inverardi, Paola ^a   Wolf, Alexander L ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE;

ARCHITECTURAL DESCRIPTION FORMALISM; COMPRESSING PROXY SYSTEM;

SOFTWARE ENGINEERING;

EID: 0033079780     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(98)00006-9     Document Type: Article

References (24)

1. G.D. Abowd, R. Allen, D. Garlan, Formalizing style to understand descriptions of software architecture, ACM Trans. Software Eng, and Methodology 4 (4) (1995) 319-364.
2. R. Allen, D. Garlan, A. formal basis for architectural connection, ACM Trans. Software Eng. and Methodology 6 (3) (1997) 213-249.
3. J.-P. Banâtre, D. Le Métayer, The gamma model and its discipline of programming, Science of Computer Programming 15 (1) (1990) 55-77.
4. J.-P. Banâtre, D. Le Métayer, Programming by multiset transformation, Comm. ACM 36 (1) (1993) 98-111.
5. G. Berry, G. Boudol, The chemical abstract machine, Theoret. Comput. Sci. 96 (1992) 217-248.
6. G. Boudol, Some chemical abstract machines, in: A Decade of Concurrency, Lecture Notes in Computer Science, Vol. 803, Springer, Berlin, 1994, pp. 92-123.
7. D. Compare, Specifica ed Analisi del CERN Compressing Proxy con la CHAM, Technical Report Tesi di Laurea, Dipartimento di Matematica Pura ed Applicata, L'Aquila, Italy, December 1995.
8. D. Compare, P. Inverardi, Modelling interoperability by CHAM: A case study, in: Proc. First Internat. Conf. on Coordination Models and Languages, Lecture Notes in Computer Science, Vol. 1061, Springer, Berlin, April 1996, pp. 428-431.
9. N. De Francesco, P. Inverardi, Proving finiteness of CCS processes by non-standard semantics, Acta Inform. 31 (1) (1994) 55-80.
10. Formal Systems, Ltd., Failures Divergence Refinement: User Manual and Tutorial, Formal Systems, Ltd., Oxford, England, October 1992.
11. D. Garlan, R. Allen, J. Ockerbloom, Architectural mismatch: Why reuse is so hard, IEEE Software 12 (6) (1995) 17-26.
12. D. Garlan, D. Kindred, J.M. Wing, Interoperability: Sample problems and solutions, Technical Report, Carnegie Mellon University, Pittsburgh, PA, in preparation.
13. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall Englewood Cliffs, NJ, 1985.
14. P. Inverardi, A.L. Wolf, Formal specification and analysis of software architectures using the chemical abstract machine model, IEEE Trans. Software Eng. 21 (4) (1995) 373-386.
15. F. Corradini, P. Inverardi, A.L. Wolf, On the choice of a software architecture: a guided tour in the analysis of architectural design, Available from the authors, October 1998.
16. P. Inverardi, A.L. Wolf, D. Yankelevich, Checking assumptions in component dynamics at the architectural level, in: Proc. 2nd Internat. Conf. on Coordination Models and Languages, Lecture Notes in Computer Science, Vol. 1282, Springer, Berlin, September 1997, pp. 46-63.
17. D.C. Luckham, J.J. Kenney, L.M. Augustin, J. Vera, D. Bryan, W. Mann, Specification and analysis of system architecture using Rapide, IEEE Trans. Software Eng. 21 (4) (1995) 336-355.
18. D.C. Luckham, J. Vera, An event-based architecture definition language, IEEE Trans. Software Eng. 21 (9) (1995) 717-734.
19. D. Le Métayer, Software architecture styles as graph grammars, in: Proc. Fourth ACM SIGSOFT Symp. on the Foundations of Software Engineering, ACM SIGSOFT, October 1996, pp. 15-23.
20. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
21. D.E. Perry, A.L. Wolf, Foundations for the study of software architecture, SIGSOFT Software Eng. Notes 17 (4) (1992) 40-52.
22. A. Rosetti, Generazione di test cases da specifiche formali della architettura software. Technical Report Tesi di Laurea, Dipartimento di Matematica Pura ed Applicata, L'Aquila, Italy, March 1997.
23. J.M. Spivey, Understanding Z: A Specification Language and its Formal Semantics, Cambridge University Press, Cambridge, 1989.
24. D. Taubner, Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, Lecture Notes in Computer Science, Vol. 369 Springer, Berlin, 1989.