Task interaction graphs for concurrency analysis
ICSE '89 Proceedings of the 11th international conference on Software engineering
Process algebra
Applications of process algebra
Applications of process algebra
Task structure semantics through process algebra
Software Engineering Journal
Static detection of deadlocks in polynomial time
Static detection of deadlocks in polynomial time
A compact Petri net representation for concurrent programs
Proceedings of the 17th international conference on Software engineering
Formal modeling of synchronization methods for concurrent objects in Ada 95
Proceedings of the 1999 annual ACM SIGAda international conference on Ada
Slicing concurrent java programs
ACM SIGPLAN Notices
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Analyzing Ada Tasking Deadlocks and Livelocks Using Extended Petri Nets
Proceedings of the Ada-Europe International Conference on Ada: The Choice for '92
Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs
Ada-Europe '00 Proceedings of the 5th Ada-Europe International Conference on Reliable Software Technologies
Process algebra model of Ada protected objects
ACM SIGPLAN Notices
| Hi-index | 0.00 |
Many approaches have been presented to detect deadlock of Ada concurrent programs. Most of them adopt some kind of flow structure or Petri nets. In this paper, we express Ada rendezvous flow structure using process algebra. Through the deduction of process algebra expressions with equivalence, information about communications among processes can be obtained. Together with the help of communication dependence analysis, the paper proposes a static approach to detect deadlock in Ada rendezvous flow structure.