Context Constraints for Compositional Reachability Analysis

ACM Transactions on Software Engineering and Methodology

Volumn 5, Issue 4, 1996, Pages 334-377

  Cheung, Shing Chi ^a   Kramer, Jeff ^b  

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

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

D.2.1 Software Engineering : Requirements Specifications; D.2.2 Software Engineering : Tools and Techniques; D.3.2 Programming Languages : Language Classifications concurrent, distributed, and parallel languages

Indexed keywords

AUTOMATION; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; USER INTERFACES;

COMPOSITIONAL REACHABILITY ANALYSIS (CRA); CONTEXT CONSTRAINTS; GLOBAL REACHABILITY GRAPH; STATE EXPLOSION PROBLEM;

CONTEXT SENSITIVE LANGUAGES;

EID: 0030265144     PISSN: 1049331X     EISSN: None     Source Type: Journal    
DOI: 10.1145/235321.235323     Document Type: Article

References (41)

1. AVRUNIN, G. S., BUY, U. A., CORBETT, J. C., DILLON, L. K., AND WILEDEN, J. C. 1991. Experiments with an improved constrained expression toolset. In Proceedings of the Symposium on Testing, Analysis, and Verification (TAV4). ACM, New York.
2. BERGSTRA, J. A. AND KLOP, J. W. 1985. Algebra of communicating processes with abstraction. Theor. Comput. Sci. 37, 77-121.
3. BROOKES, S., HOARE, C. A. R., AND ROSCOE, A. 1984. A theory of communicating sequential processes. ACM 31, 3, 560-599.
4. CCITT. 1984. Integrated Services Digital Network (ISDN) Recommendation. CCITT Red Book. Study Group 18, vol. 3, fascicle III.5.
5. CHEUNG, S. C. AND KRAMER, J. 1994a. An integrated method for effective behaviour analysis of distributed systems. In Proceedings of the 16th IEEE International Conference on Software Engineering (ICSE16). IEEE, New York.
6. CHEUNG, S. C. AND KRAMER, J. 1994b. Tractable dataflow analysis for distributed systems. IEEE Trans. Softw. Eng. 20, 8 (Aug.).
7. CHEUNG, S. C. AND KRAMER, J. 1995a. Compositional reachability analysis of finite-state distributed systems with user-specified constraints. In Proceedings of the 3rd ACM SIG-SOFT Symposium on the Foundations of Software Engineering. ACM, New York.
8. CHEUNG, S. C. AND KRAMER, J. 1995b. Contextual local analysis in the design of distributed systems. Int. J. Automat. Softw. Eng. 2, 1 (Mar.).
9. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1983. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In Proceedings of the 10th Annual ACM Symposium on Principles of Programming Languages. ACM, New York.
10. CLARKE, E. M., EMERSON, E. A., AND SISTLA, A. P. 1986. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Trans. Program. Lang. Syst. 8, 2, 244-263.
11. CLARKE, E. M., LONG, D. E., AND MCMILLAN, K. L. 1989. Compositional model checking. In Proceedings of the 4th Annual Symposium on Logic in Computer Science.
12. DENICOLA, R. AND HENNESSY, M. 1984. Testing equivalences for processes. Theor. Comput. Sci. 34, 83-133.
13. FISCHER, S., SCHOLZ, A., AND TAUBNER, D. 1992. Verification in process algebra of the distributed control of track vehicles - A case study. In Proceedings of the 4th International Workshop on Computer-Aided Verification (CAV'92). ACM, New York.
14. GARMAN, J. R. 1981. The bug heard around the world. ACM SIGSOFT Softw. Eng. Notes 6, 5.
15. GHEZZI, C., JAZAYERI, M., AND MANDRIOLI, D. 1991. Fundamentals of Software Engineering. Prentice-Hall, Englewood Cliffs, N.J., chapter 6.
16. GRAF, S. AND STEFFEN, B. 1990. Compositional minimization of finite state systems. In Proceedings of the 2nd International Conference of Computer-Aided Verification. ACM, New York.
17. HAREL, D. 1988. On visual formalisms. Commun. ACM 31, 5, 514-530.
18. HELMBOLD, D. AND LUCKHAM, D. 1985. Debugging Ada tasking programs. IEEE Softw. 2, 2 (Mar.), 47-57.
19. HENNESSY, M. 1988. Algebraic Theory of Processes. MIT Press, Cambridge, Mass.
20. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, N.J.
21. HOLZMANN, G. 1991. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, N.J., chapters 8 and 11.
22. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
23. KEMPPAINEN, J., LEVANTO, M., VALMARI, A., AND CLEGG, M. 1992. "ARA" puts advanced reachability analysis techniques together. In Proceedings of the 5th Nordic Workshop on Programming Enviornment Research. Also available as Tech. Rep. 14, Software Systems Laboratory, Tampere Univ. of Technology, Tampere, Finland.
24. KRAMER, J., MAGEE, J., NG, K., AND SLOMAN, M. 1993. The system architect's assistant for design and construction of distributed systems. In Proceedings of the 4th IEEE Workshop on Future Trends of Distributed Computing Systems. IEEE, New York.
25. KRUMM, H. 1989. Projections of the reachability graph and environment models. In Proceedings of the International Workshops on Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science, vol. 407. Springer-Verlag, Berlin.
26. LARSEN, K. AND MILNER, R. 1987. Verifying a protocol using relativized bisimulation. In Proceedings of the 14th International Colloquium, on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 267. Springer-Verlag, Berlin.
27. LARSEN, K. G. 1989. Compositional theories based on an operational semantics of contexts. In Proceedings of the REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness. Lecture Notes in Computer Science, vol. 430. Springer-Verlag, Berlin.
28. MALHOTRA, J., SMOLKA, S. A., GIACALONE, A., AND SHAPIRO, R. 1988. A tool for hierarchical design and simulation of concurrent systems. In Proceedings of the BCS-FACS Workshop on Specification and Verification of Concurrent Systems. British Computer Society, Swindon, England.
29. MILNER, R. 1989. Communication and Concurrency. P:rentice-Hall, Englewood Cliffs, N.J.
30. MILNER, R., PARROW, J., AND WALKER, D. 1989. A calculus of mobile processes part I and II. Tech. Rep. Univ. of Edinburgh, Edinburgh, U.K. June.
31. PETERSON, J. L. 1981. Petri Net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs, N.J.
32. RABINOVICH, A. 1992. Checking equivalences between concurrent systems of finite agents. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin.
33. SABNANI, K. K., LAPONE, A. M., AND UYAR, M. U. 1989. An algorithmic procedure for checking safety properties of protocols. IEEE Trans. Commun. 37, 9 (Sept.), 940-948.
34. SMOLKA, S. A. 1984. Analysis of communication finite state processes. Ph.D. thesis, CS-84-05, Dept. of Computer Science, Brown Univ., Providence, R.I.
35. TAI, K. C. AND KOPPOL, P. V. 1993. An incremental approach to reachability analysis of distributed programs. In Proceedings of the 7th IEEE International Workshop on Software Specification and Design. IEEE, New York.
36. TAYLOR, R. N. 1983a. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica 19, 57-84.
37. TAYLOR, R. N. 1983b. A general-purpose algorithm for analyzing concurrent programs. Commun. ACM 26, 362-376.
38. VALMARI, A. 1991. Compositional state space generation. Tech. Rep., A-1991-5, Dept. of Computer Science, Univ. of Helsinki, Finland. Oct.
39. VALMARI, A. 1992. Alleviating state explosion during verification of behavioural equivalence. Tech. Rep., A-1992, Dept. of Computer Science, Univ. of Helsinki, Finland. Aug.
40. YEH, W. J. 1993. Controlling state explosion in reachability analysis. Tech. Rep., SERC-TR-147-P, SERC, Purdue Univ., West Lafayette, Ind. Dec.
41. YEH, W. J. AND YOUNG, M. 1991. Compositional reachability analysis using process algebra. In Proceedings of the Symposium on Testing, Analysis, and Verification (TAV4). ACM, New York.