Checking safety properties using compositional reachability analysis

ACM Transactions on Software Engineering and Methodology

Volumn 8, Issue 1, 1999, Pages 49-78

  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

Compositional reachability analysis; Design; Distributed systems; Model checking; Safety properties; Static analysis; Theory; Verification

Indexed keywords

EID: 0001861464     PISSN: 1049331X     EISSN: None     Source Type: Journal    
DOI: 10.1145/295558.295570     Document Type: Article

References (59)

1. ALPERN, B. AND SCHNEIDER, F. B. 1985. Defining liveness. Inf. Process. Lett. 21, 4 (Oct.), 181-185.
2. ANDERSON, R. J., BEAME, P., BURNS, S., CHAN, W., MODUGNO, F., NOTKIN, D., AND REESE, J. D. 1996. Model checking large software specification. In Proceedings of the 4th ACM SIGSOFT Symposium on the Foundations of Computer Science (SIGSOFT '96, San Francisco, CA, Oct.). ACM Press, New York, NY, 156-166.
3. AVRUNIN, G. S., BUY, U. A., CORBETT, J. C., DILLON, L. K., AND WILEDEN, J. C. 1991. Automated analysis of concurrent systems with the constrained expression toolset. IEEE Trans. Softw. Eng. 17, 11 (Nov.), 1204-1222.
4. BHARADWAJ, R. AND HEITMEYER, C. 1997. Model checking complete requirements specifications using abstraction. Rep. NRL/MR/5540-97-7999. Information Technology Division, Naval Research Laboratory, Washington, DC.
5. BROY, M. AND JAHNICHEN, S. 1993. Korrekte Software durch formale Methoden. Technische Universitat Berlin, Berlin, Germany.
6. CHEUNG, K. H. 1998. Compositional analysis of complex distributed systems. Ph.D. Dissertation. Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong.
7. CHEUNG, S. C. AND KRAMER, J. 1993. Enhancing compositional reachability analysis with context constraints. In Proceedings of the 1st ACM SIGSOFT International Symposium on the Foundations of Software Engineering (SIGSOFT '93, Los Angeles, CA, Dec.). ACM Press, New York, NY, 115-125.
8. CHEUNG, S. C. AND KRAMER, J. 1994. Tractable dataflow analysis for distributed systems. IEEE Trans. Softw. Eng. 20, 8 (Aug.), 579-593.
9. CHEUNG, S. C. AND KRAMER, J. 1995. Compositional reachability analysis of finite-state distributed systems with user-specified constraints. In Proceedings of the 3rd ACM SIGSOFT Symposium on the Foundations of Software Engineering (SIGSOFT '95, Wahington, DC, Oct.). ACM Press, New York, NY, 140-150.
10. CHEUNG, S. C. AND KRAMER, J. 1996a. Checking subsystem safety properties in compositional reachability analysis. In Proceedings of the 18th International Conference on Software Engineering (ICSE '96, Berlin, Germany, Mar.). IEEE Press, Piscataway, NJ, 144-154.
11. CHEUNG, S. C. AND KRAMER, J. 1996b. Context constraints for compositional reachability analysis. ACM Trans. Softw. Eng. Methodol. 5, 4 (Oct.), 334-377.
12. CHEUNG, S. C., GIANNAKOPOULOU, D., AND KRAMER, J. 1997. Verification of liveness properties using compositional reachability analysis. In Proceedings of the 6th European Software Engineering Conference (ESEC/FSE '97, Zurich, Switzerland, Sept. 22-25). 227-243.
13. 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 (Pacific Grove, CA, June). IEEE Press, Piscataway, NJ, 353-362.
14. CORBETT, J. C. 1996. Evaluating deadlock detection methods for concurrent software. IEEE Trans. Softw. Eng. 22, 3 (Mar.), 161-180.
15. CORBETT, J. C. AND AVRUNIN, G. S. 1995. Using integer programming to verify general safety and liveness properties. Formal Methods Syst. Des. 6, 1 (Jan.), 97-123.
16. DWYER, M. B. AND CLARKE, L. A. 1994. Data flow analysis for verifying properties of concurrent programs. In Proceedings of the 2nd ACM SIGSOFT Symposium on the Foundations of Software Engineering (SIGSOFT '94, New Orleans, LA, Dec.). ACM Press, New York, NY, 62-75.
17. DWYER, M. B., CARR, V., AND HINES, L. 1997. Model checking graphical user interfaces using abstractions. In Proceedings of the 6th European Software Engineering Conference (ESEC/ FSE '97, Zurich, Switzerland, Sept. 22-25). 244-261.
18. GHEZZI, C., JAZAYERI, M., AND MANDRIOLI, D. 1991. Fundamentals of Software Engineering. Prentice-Hall, Inc., Upper Saddle River, NJ.
19. GIANNAKOPOULOU, D., KRAMER, J., AND CHEUNG, S. C. 1999. Behaviour analysis of distributed systems using the Tracta approach. J. Autom. Softw. Eng. 6, 1 (Mar.).
20. GODEFROID, P. 1990. Using partial orders to improve automatic verification methods. In Proceedings of the 2nd International Conference on Computer Aided Verification (CAV, New Brunswick, NJ, June). Lecture Notes in Computer Science, vol. 531. Springer-Verlag, Berlin, Germany, 176-185.
21. GODEFROID, P. AND WOLPER, P. 1991. Using partial orders for the efficient verification of deadlock freedom and safety properties. In Proceedings of the 3rd International Conference on Computer Aided Verification (CAV, Aalborg, Denmark, July). Lecture Notes in Computer Science, vol. 575. Springer-Verlag, Berlin, Germany, 332-342.
22. GRAF, S. AND STEFFEN, B. 1990. Compositional minimization of finite state systems. In Proceedings of the 2nd International Conference on Computer Aided Verification (CAV, New Brunswick, NJ, June). Lecture Notes in Computer Science, vol. 531. Springer-Verlag, Berlin, Germany, 186-196.
23. HELMBOLD, D. AND LUCKHAM, D. 1985. Debugging Ada tasking programs. IEEE Softw. 2, 2 (Mar.), 47-57.
24. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall International Series in Computer Science. Prentice-Hall, Inc., Upper Saddle River, NJ.
25. HOLZMANN, G. J. 1991. Design and Validation of Computer Protocols. Prentice-Hall Software Series. Prentice-Hall, Inc., Upper Saddle River, NJ.
26. HOLZMANN, G. J. 1997. The model checker SPIN. IEEE Trans. Softw. Eng. 23, 5 (May), 279-295.
27. HOLZMANN, G., GODEFROID, P., AND PIROTTIN, D. 1992. Coverage preserving reduction strategies for reachability analysis. In Proceedings of the International Symposium on Protocol Specification, Testing, and Verification (PSTV '92, Lake Buena Vista, FL, June). North-Holland Publishing Co., Amsterdam, The Netherlands, 349-364.
28. JUVAL, G. 1998. Specification and verification of an object request broker. In Proceedings of the International Conference on Software Engineering (ICSE '98, Kyoto, Japan, Apr.). IEEE Press, Piscataway, NJ, 43-52.
29. 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 Environment Research (Tampere, Finland, Jan.). 233-257.
30. LEWERENTZ, C. AND LINDNER, T. 1995. Formal Development of Reactive Systems - Case Study Production Cell. Springer Lecture Notes in Computer Science, vol. 891. Springer-Verlag, Berlin, Germany.
31. LONG, D. AND CLARKE, L. 1989. Task interaction graphs for concurrency analysis. In Proceedings of the 11th International Conference on Software Engineering (ICSE '89). IEEE Press, Piscataway, NJ, 44-52.
32. MAGEE, J., DULAY, N., EISENBACH, S., AND KRAMER, J. 1995. Specifying distributed software architectures. In Proceedings of the 5th European Software Engineering Conference. Lecture Notes in Computer Science, vol. 989. Springer-Verlag, New York, NY, 137-153.
33. MAGEE, J., DULAY, N., AND KRAMER, J. 1994. Regis: A constructive development environment for distributed programs. Distrib. Syst. Eng. 1, 5, 304-312.
34. 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 (Stirling, Scotland, July). British Computer Society, Swinton, UK, 140-152.
35. MANNA, Z. AND PNUELI, A. 1995. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, NY.
36. MASCARENHAS, R., KARUMURI, D., BUY, U., AND KENYON, R. 1998. Modeling and analysis of a virtual reality system with time Petri nets. In Proceedings of the International Conference on Software Engineering (ICSE '98, Kyoto, Japan, Apr.). IEEE Press, Piscataway, NJ, 33-42.
37. MASTICOLA, S. P. AND RYDER, B. G. 1991. A model of Ada programs for static deadlock detection in polynomial time. In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging (Santa Cruz, CA, May 20-21), B. Miller and C. McDowell, Eds. ACM Press, New York, NY.
38. MCMILLAN, K. L. 1993. Symbolic Model Checking. Kluwer Academic Publishers, Hingham, MA.
39. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall International Computer Science Series. Prentice-Hall, Inc., Upper Saddle River, NJ.
40. MILNER, R., PAHROW, J., AND WALKER, D. 1989. A calculus of mobile processes Part I and II. University of Edinburgh, Edinburgh, UK.
41. NAUMOVICH, G., AVRUNIN, G. S., CLARKE, L. A., AND OSTERWEIL, L. J. 1997. Applying static analysis to software architectures. In Proceedings of the 6th European Software Engineering Conference (ESEC/FSE '97, Zurich, Switzerland, Sept. 22-25). 77-93.
42. NG, K., KRAMER, J., MAGEE, J., AND DULAY, N. 1996. A visual approach to distributed programming. In Tools and Environments for Parallel and Distributed Systems. Kluwer Academic Publishers, Hingham, MA, 7-31.
43. OLENDER, K. M. AND OSTERWEIL, L. J. 1990. Cecil: A sequencing constraint language for automatic static analysis generation. IEEE Trans. Softw. Eng. 16, 3 (Mar.), 268-280.
44. PAIGE, R. AND TARJAN, R. E. 1987. Three partition refinement algorithms. SIAM J. Comput. 16, 6 (Dec. 1), 973-989.
45. PETERSON, J. L. 1981. Petri Net Theory and the Modelling of Systems. Prentice-Hall, Inc., Hertfordshire, United Kingdom.
46. PEZZÈ, M., TAYLOR, R. N., AND YOUNG, M. 1995. Graph models for reachability analysis of concurrent programs. ACM Trans. Softw. Eng. Methodol. 4, 2 (Apr.), 171-213.
47. RABINOVICH, A. 1992. Checking equivalences between concurrent systems of finite agents. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (Wien, Austria, July). Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, Germany, 696-707.
48. REIF, J. H. AND SMOLKA, S. A. 1990. Data flow analysis of distributed communicating processes. Int. J. Parallel Program. 19, 1 (Feb.), 1-30.
49. SABNANI, K. K., LAPONE, A. M., AND UYAR, M. 1989. An algorithmic procedure for checking safety properties of protocols. IEEE Trans. Commun. 37, 9 (Sept.), 940-948.
50. TAI, K. C. AND KOPPOL, P. V. 1993a. Hierarchy-based incremental reachability analysis of communication protocols. In Proceedings of the IEEE International Conference on Network Protocols (San Francisco, CA, Oct.). IEEE Press, Piscataway, NJ, 318-325.
51. TAI, K. C. AND KOPPOL, P. V. 1993b. An incremental approach to reachability analysis of distributed programs. In Proceedings of the 7th International Workshop on Software Specification and Design (Los Angeles, CA, Dec.). IEEE Press, Piscataway, NJ, 141-150.
52. TAYLOR, R. N. 1983. A general-purpose algorithm for analyzing concurrent programs. Commun. ACM 26, 5 (May), 361-376.
53. VALMARI, A. 1991. Stubborn sets for reduced state space generation. In Advances in Petri Nets 90 (APN '90), G. Rozenberg, Ed. Lecture Notes in Computer Science, vol. 483. Springer-Verlag, New York, NY, 491-515.
54. VALMARI, A. 1992. Alleviating state explosion during verification of behavioural equivalence. Department of Computer Science, University of Helsinki, Helsinki, Finland.
55. VALMARI, A., KEMPPAINEN, J., CLEGG, M., AND LEVANTO, M. 1993. Putting advanced reachability analysis techniques together: The 'ARA' tool. In Proceedings of the 1st International Symposium of Formal Methods Europe: Industrial-Strength Formal Methods (FME '93, Odense, Denmark, Apr.). 597-616.
56. YEH, W. J. 1993. Controlling state explosion in reachability analysis. Tech. Rep. SERC-TR-147-P. Software Engineering Research Center (SERC) Laboratory, Purdue University, West Lafayette, IN.
57. YEH, W. J. AND YOUNG, M. 1991. Compositional reachability analysis using process algebra. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis, and Verification (SIGSOFT '91, Victoria, British Columbia, Oct.). ACM Press, New York, NY, 49-59.
58. YEH, W. J. AND YOUNG, M. 1993. Hierarchical tracing of concurrent programs. Tech. Rep. SERC-TR-137-P. Software Engineering Research Center (SERC) Laboratory, Purdue University, West Lafayette, IN.
59. YOUNG, M., TAYLOR, R. N., LEVINE, D. L., NIES, K. A., AND BRODBECK, D. 1995. A concurrency analysis tool suite for Ada programs: Rationale, design, and preliminary experience. ACM Trans. Softw. Eng. Methodol. 4, 1 (Jan.), 65-106.