Task-wait-for graphs and their application to handling tasking deadlocks

Authors:
Jingde Cheng
Affiliations:
Department of Computer Science and Communication Engineering, Kyushu University, Hakozaki, Fukuoka 812, Japan
Venue:
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Year:
1990

Citing 7
Cited 4

Tasking communication deadlocks in concurrent Ada programs

ACM SIGAda Ada Letters
Detection of Ada Static Deadlocks Using Petri Net Invariants

IEEE Transactions on Software Engineering
Controlling deadlock in Ada

ACM SIGAda Ada Letters
A general-purpose algorithm for analyzing concurrent programs

Communications of the ACM
A survey of tasking deadlock detection methods

ACM SIGAda Ada Letters
A classification of tasking deadlocks

ACM SIGAda Ada Letters
Runtime detection and description of deadness errors in Ada tasking

ACM SIGAda Ada Letters

A General Framework for Debugging

IEEE Software
Tasking deadlocks in programs with the full Ada 95

ACM SIGAda Ada Letters
Run-time detection of tasking deadlocks in real-time systems with the ada 95 annex of real-time systems

Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
New types of tasking deadlocks in Ada 2012 programs

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formal representation of the state of tasking object interaction in concurrent Ada programs is indispensable in order to handle tasking deadlocks occurring in the programs correctly. This paper presents a formal model, named “Task-Wait-For Graphs”, for the state of tasking object interaction and shows its application to handling tasking deadlocks. After defining the model and showing its basic properties, the paper gives a complete classification for tasking deadlocks, shows necessary and sufficient conditions for occurrences of these tasking deadlocks, points out that none of tasking deadlock detection methods proposed in recent years is correct in the sense of detecting all tasking deadlocks in any Ada program, and discusses how to detect the tasking deadlocks correctly based on the model.