Deadlock analysis of synchronous message-passing programs

International Workshop on Software Engineering for Parallel and Distributed Systems, Proceedings

Volumn , Issue , 1999, Pages 62-69

  Zhou, Jun ^a   Tai, Kuo chung ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEADLOCK CUTOFF NUMBER; SYNCHRONOUS MESSAGE PASSING PROGRAMS;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; ERROR DETECTION; NUMBER THEORY; THEOREM PROVING;

COMPUTER SYSTEM RECOVERY;

EID: 0032593054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (16)

1. M. C. Browne, E. M. Clarke, O. Grumberg. "Characterizing Finite Kripke Structures in Propositional Temporal Logic," Theoretical Computer Science, vol. 59,1988,115-131.
2. R. Cleaveland, J. Parrow, and B. Steffen. "The concurrency workbench: a semantics tool for the verification of concurrent systems",ACM Trans. Programming Languages and Systems, Vol. 15, No. 1,Jan. 1993,36-72.
3. R. Cleaveland, J. N. Gada,P. M. Lewis, S. A. Smolka, O. Sokolsky, and S. Zhang. "The Concurrency Factory - Practical Tools for Specification, Simulation, Verification and Implementation of Concurrent Systems",Proc. DIMACS Workshop on Specification of Parallel Algorithms, 1994, 75-90.
4. C.A.R. Hoare, "Communicating sequential processes," Comm. ACM, Vol. 21, no. 8, pp. 666-677,1978.
5. D. Helmbold and D. Luckham. "Debugging Ada Tasking Programs" IEEE Software, 2(2):47-57, March 1985.
6. S. Duri, U. Buy, R. Devarapali, S. M. Shatz. "Application and Experimental Evaluation of State Space Reduction Methods for Deadlock Analysis in Ada" ACMTrans. Software Engineering and Methodology, vol. 3, no. 4, Oct. 1994,340-380.
7. E. A. Emerson, K. S. Namjoshi. "Reasoning About Rings," Proc. ACM 22th Principles of Programming Languages, 1995,85-94.
8. V. K. Garg. "Analysis of Distributed Systems With Many identical Processes," Proc. IEEE 8th Int. Conf. on Distributed Computing Systems, 358-365.
9. R. Milner. Communication and Concurrency, Prentice- Hall, 1989.
10. M. Pezze, R. N. Taylor and M. Young. "Graph Models for Reachability Analysis of Concurrent Programs" ACM Trans. Software Eng. and Methodology, vol. 4, no. 4, pp. 171-213,April 1995.
11. B. Karacali andK. C. Tai, " Automated test sequence generation using sequencing constraints for concurrent programs ",Proc. Inter. Symposium on Software Engineering for Parallel and Distributed Systems, May 1999.
12. K. C. Tai. "Definitions and Detection of Deadlock, Livelock, and Starvation in Concurrent Programs " Proc. Int. Conf. Parallel Processing, Vol. II, Aug. 1994, 62-72.
13. Tai, K. C., and Carver, R. H., "Testing of distributed programs", chapter 33 ofHandbook ofParallel and Distributed Computing, edited by A. Zomaya, McGraw-Hill, 1996,955-978.
14. T. Bolognesi, E. Brinksma. "Introduction to the ISO Specification Language LOTOS ", Computer Networks and ISDN Systems, Vol. 14, No. 1,1987.
15. M. Young, R. N. Taylor, D. L. Levine, K. A. Niles and D. Brodbeck. "A Concurrency Analysis Tool Suite for Ada Programs: Rationale, Design and Preliminary Experience", ACMTrans. Software Eng. and Methodology, vol. 4, no. 1,pp. 65-106, Jan. 1995.
16. J. Zhou and K. C. Tai, "Deadlock Analysis of Basic LOTOS Programs", submitted forpublication, 1999.