Blocking-based simultaneous reachability analysis of asynchronous message-passing programs

Proceedings - International Symposium on Software Reliability Engineering, ISSRE

Volumn 2002-January, Issue , 2002, Pages 316-326

  Lei, Yu ^a   Tai, Kuo Chung ^b  

^a The University of Texas at Arlington   (United States)

^b North Carolina State University   (United States)

Author keywords

Asynchronous communication; Computer science; Distributed algorithms; Fault detection; Protocols; Reachability analysis; Reliability engineering; Software reliability; State space methods; System recovery

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SYSTEM RECOVERY; DISTRIBUTED COMPUTER SYSTEMS; FAULT DETECTION; MODEL CHECKING; NETWORK PROTOCOLS; PARALLEL ALGORITHMS; RELIABILITY; RELIABILITY ANALYSIS; SOFTWARE RELIABILITY; STATE SPACE METHODS;

ASYNCHRONOUS COMMUNICATION; COMMUNICATION SCHEMES; MESSAGE PASSING PROGRAMS; PARTIAL ORDER REDUCTIONS; REACHABILITY ANALYSIS; REACHABILITY GRAPHS; RELIABILITY ENGINEERING; SYSTEM RECOVERY;

MESSAGE PASSING;

EID: 27144535067     PISSN: 10719458     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISSRE.2002.1173279     Document Type: Conference Paper

References (16)

1. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems. Springer, 1996.
2. P. Godefroid and D. Pirottin. Refining dependencies improves partial-order verification methods. In Proc. CAV'93, volume 697, pages 438-449, 1993.
3. B. Karacali. Simultaneous Reachability Analysis of Concurrent Systems. PhD thesis, Department of Computer Science, North Carolina State University, 2000.
4. B. Karacali and K. Tai. Automated test sequence generation using sequencing constraints for concurrent programs. In Proc. International Symposium on Software Engineering for Parallel and Distributed Systems, pages 97-108, 2000.
5. B. Karacali and K. Tai. Model checking based on simultaneous reachability analysis. In Lecture Notes in Computer Science, volume 1885, pages 34-53. Springer, 2000.
6. B. Karacali, K. Tai, and M. Vouk. Deadlock detection of efsms using simultaneous reachability analysis. In Proc. IEEE Dependable Systems and Networks, pages 315-324, June 2000.
7. K. Ozdemir and H. Ural. Protocol validation by simultaneous reachability analysis. Computer Communications, pages 772-788, 1997.
8. D. Peled. Combining partial order reductions with on-thefly model-checking. In Proceedings of the 6th International Conference on Computer-Aided Verification, pages 377-390, June 1994.
9. M. Pezze, R. N. Taylor, and M. Young. Graph models for reachability of concurrent programs. ACM Trans. on Software Engineering and Methodology, 4(2), 1995.
10. M. Raynal. Distributed Algorithms and Protocols. John Wiley & Sons, 1988.
11. K. Tai. Race analysis of traces of asynchronous messagepassing programs. In Proc. 17th International Conference on Distributed Computing Systems, pages 261-268, May 1997.
12. A. S. Tanenbaum. Computer Networks. Prentice Hall, 1996.
13. R. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57-84, 1983.
14. A. Valmari. Stubborn sets for reduced state space generation. Lecture Notes in Computer Science, 483:491-515, 1991.
15. H. van der Schoot and H. Ural. An improvement of partialorder verification. Software Testing, Verification and Relibility, 8:83-102, 1998.
16. H. van der Schoot and H. Ural. On improving reachability analysis for verifying progress properties of networks of CFSMs. In Proc. 18th Intl. Distributed Computing Systems, pages 130-137, 1998.