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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.