Behaviour Analysis of Distributed Systems Using the Tracta Approach

Automated Software Engineering

Volumn 6, Issue 1, 1999, Pages 7-35

  Giannakopoulou, Dimitra ^a   Kramer, Jeff ^a   Cheung, Shing Chi ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Automated analysis; B chi automata; Compositional reachability analysis; Concurrent and distributed systems; Labelled transition systems; Liveness properties; Model checking; Safety properties; Software architecture; Static analysis

Indexed keywords

AUTOMATA THEORY; COMPUTER ARCHITECTURE; COMPUTER SOFTWARE SELECTION AND EVALUATION; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HIERARCHICAL SYSTEMS;

AUTOMATED ANALYSIS; BUCHI AUTOMATA; COMPOSITIONAL REACHABILITY ANALYSIS (CRA); LABELLED TRANSITION SYSTEMS; STATIC ANALYSIS; TRACTA APPROACH;

SOFTWARE ENGINEERING;

EID: 0032657132     PISSN: 09288910     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008645800955     Document Type: Article

References (44)

1. Aggarwal, S., Courcoubetis, C., and Wolper, P. 1990. Adding liveness properties to coupled finite-state machines. ACM Transactions on Programming Languages and Systems, 12(2):303-339.
2. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley.
3. Andrews, G.R. 1991. Concurrent Programming - Principles and Practice. The Benjamin/Cummings Publishing Company Ltd.
4. Cheung, S.C., Giannakopoulou, D., and Kramer, J. 1997. Verification of liveness properties using compositional reachability analysis. In M. Jazayeri and H. Schauer, editors, Proc. of the 6th European Software Engineering Conference held jointly with the 5th ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE'97), Zurich, Switzerland. Lecture Notes in Computer Science 1301, pp. 227-243.
5. Cheung, S.C. and Kramer, J. 1996a. Checking subsystem safety properties in compositional reachability analysis. Proc. of the 18th International Conference on Software Engineering, Berlin, Germany, pp. 144-154.
6. Cheung, S.C. and Kramer, J. 1996b. Context constraints for compositional reachability analysis. ACM Transactions on Software Engineering and Methodology, 5(4):334-377.
7. Clarke, E.M. and Wing, J.M. 1996. Formal methods: State of the art and future directions. ACM Computing Surveys, 28(4):626-643.
8. Cleaveland, R., Parrow, J., and Steffen, B. 1993. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems, 15(1):36-72.
9. Fernandez, J.-C. 1990. An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming, 13(2/3):219-236.
10. Fernandez, J.-C., Garavel, H., Kerbrat, A., Mateesku, R., Mounier, L., and Sighireanu, M. 1996. CADP: A protocol validation and verification toolbox. In R. Alur and T.A. Henzinger, editors, Proc. of the 8th International Conference on Computer-Aided Verification (CAV'96), New Brunswick, NJ, USA. Lecture Notes in Computer Science 1102, pp. 437-440.
11. Fernandez, J.-C., Mounier, L., Jard, C., and Jéron, T. 1992. On-the-fly verification of finite transition systems. Formal Methods in System Design, 1(2/3):251-273.
12. Gerth, R., Peled, D., Vardi, M.Y., and Wolper, P. 1995. Simple on-the-fly automatic verification of linear temporal logic. Proc. of the 15th IFIP/WG6.1 Symposium on Protocol Specification, Testing and Verification (PSTV'95), Warsaw, Poland, pp. 3-18.
13. Ghezzi, C., Jazayeri, M., and Mandrioli, D. 1991. Fundamentals of Software Engineering, Chapter 6. Prentice-Hall International.
14. Giannakopoulou, D. 1995. The TRACTA approach for behaviour analysis of concurrent systems. Department of Computing, Imperial College, London, Research Report DoC 95/16.
15. Giannakopoulou, D. 1998. Model checking for concurrent software architectures. Ph.D. thesis, Department of Computing, Imperial College, London.
16. Godefroid, P. and Holzmann, G.J. 1993. On the verification of temporal properties. In A. Danthine, G. Leduc, and P. Wolper, editors, Proc. of the 13th IFIP WG 6.1 International Symposium, on Protocol Specification, Testing, and Verification (PSTV'93), Liège, Belgium, pp. 109-124.
17. Godefroid, P. and Wolper, P. 1991. Using partial orders for the efficient verification of deadlock freedom and safety properties. In K.G. Larsen and A. Skou, editors, Proc. of the 3rd International Workshop on Computer Aided Verification (CAV'91), Aalborg, Denmark. Lecture Notes in Computer Science 575, pp. 332-342.
18. Graf, S. and Steffen, B. 1990. Compositional minimization of finite state systems. In E.M. Clarke and R.P. Kurshan, editors, Proc. of the 2nd International Conference on Computer-Aided Verification (CAV'90), New Brunswick, NJ, USA. Lecture Notes in Computer Science 531, pp. 186-196.
19. Gribomont, P. and Wolper, P. 1989. Temporal logic. In A. Thayse, editor, From Modal Logic to Deductive Databases, John Wiley and Sons.
20. Hoare, C.A.R. 1985. Communicating Sequential Processes. Prentice-Hall.
21. Holzmann, G.J. 1991. Design and Validation of Computer Protocols. Prentice-Hall.
22. Holzmann, G.J., Godefroid, P., and Pirottin, D. 1992. Coverage preserving reduction strategies for reachability analysis. Proc. of the IFIP/WG6.1 International Symposium on Protocol Specification, Testing, and Verification (PSTV'92), Orlando, Florida, pp. 349-364.
23. Kanellakis, P.C. and Smolka, S.A. 1990. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68.
24. Kemppainen, J., Levanto, M., Valmari, A., and Clegg, M. 1992. "ARA" puts advanced reachability analysis techniques together. In K. Systä, P. Kellomäki, and R. Mäkinen, editors, Proc. of the 5th Nordic Workshop on Programming Environment Research, Tampere, Finland, pp. 233-257.
25. Kramer, J. and Magee, J. 1997. Exposing the skeleton in the coordination closet. In D. Garlan and D.I. Métayer, editors, Proc. of the Coordination '97, Second International Conference on Coordination Models and Languages, Berlin, Germany. Lecture Notes in Computer Science 1282, pp. 18-31.
26. Krimm, J.-P. and Mounier, L. 1997. Compositional state space generation from lotos programs. In E. Brinksma, editor, Proc. of the 3d International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'97), Enschede, The Netherlands. Lecture Notes in Computer Science 1217.
27. Lin, J.C. and Paul, S. 1996. RMTP: A reliable multicast transport protocol. Proc. of the IEEE INFOCOMM'96, San Francisco, California, pp. 1414-1424.
28. Magee, J., Dulay, N., Eisenbach, S., and Kramer, J. 1995. Specifying distributed software architecture. In W Schäfer and P. Botella, editors, Proc. of the 5th European Soflware Engineering Conference (ESEC'95), Sitges, Spain. Lecture Notes in Computer Science 989, pp. 137-153.
29. Magee, J., Dulay, N., and Kramer, J. 1994. A constructive development environment for parallel and distributed programs. Proc. of the Second International Workshop on Configurable Distributed Systems, Pittsburg, Pennsylvania, pp. 4-14.
30. Magee, J., Kramer, J., and Giannakopoulou, D. 1997. Analysing the behaviour of distributed software architectures: A case study. Proc. of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems, Tunis, Tunisia, pp. 240-245.
31. Manna, Z. and Pnueli, A. 1992. The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer-Verlag.
32. McMillan, K.L. 1993. Symbolic Model Checking. Kluwer Academic Publishers.
33. Milner, R. 1989. Communication and Concurrency. Prentice-Hall.
34. Ng, K., Kramer, J., Magee, J., and Dulay, N. 1996. A visual approach to distributed programming. Tools and Environments for Parallel and Distributed Systems, pp. 7-31.
35. Paige, R. and Tarjan, R.E. 1987. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973-989.
36. Rabinovich, A. 1992. Checking equivalences between concurrent systems of finite agents. In W. Kuich, editor, Proc. of the 19th International Colloquium on Automata, Languages and Programming, Wien, Austria. Lecture Notes in Computer Science 623, pp. 696-707.
37. Roscoe, A.W. 1994. Model-checking CSP. In A.W. Roscoe, editor, A Classical Mind: Essays in Honour of C.A.R. Hoare, Prentice Hall International Series in Computer Science, Prentice-Hall, pp. 353-378.
38. Sabnani, K.K., Lapone, A.M., and Uyar, M.Ü. 1989. An algorithmic procedure for checking safety properties of protocols. IEEE Transactions on Communications, 37(9):940-948.
39. Tai, K.C. and Koppol, P.V. 1993. An incremental approach to reachability analysis of distributed programs. Proc. of the 7th International Workshop on Software Specification and Design, Los Angeles, California.
40. Tarjan, R. 1972. Depth-first search and linear graph alogrithms. SIAM Journal of Computing, 1:146-160.
41. Valmari, A. 1992. Alleviating state explosion during verification of behavioural equivalence. Research Report A-1992, Department of Computer Science, University of Helsinki, Finland.
42. Valmari, A. 1993. Compositional state space generation. In G. Rozenberg, editor, Proc. of the Advances in Petri Nets, Leiden, The Netherlands. Lecture Notes in Computer Science 674, pp. 427-457.
43. Vardi, M.Y. and Wolper, P. 1986. An automata-theoretic approach to automatic program verification. Proc. of the 1st Symposium on Logic in Computer Science, Cambridge, pp. 322-331.
44. Yeh, W.J. 1993. Controlling state explosion in reachability analysis. Ph.D. thesis SERC-TR-147-P, SERC, Purdue University.