Abstract

To avoid and resolve tasking deadlocks in Ada programs, it is indispensable to identify and detect all types of tasking deadlocks. Various combinations of synchronization waiting relations concerning synchronization waiting tasks may lead to various types of tasking deadlocks. As a substantial expansion of Ada 2005, Ada 2012 has many new facilities, and therefore, these changes have a great impact on Ada tasking deadlocks and their detection. Though a tasking deadlock detector for Ada 2005 and Ada 95 was developed, it cannot detect new types of tasking deadlocks in Ada 2012 programs. This paper presents a new tasking deadlock detector for Ada 2012 programs that we are developing. At first, we analyzed various types of tasking deadlocks concerning new synchronization waiting relations defined in Ada 2012. After that we designed the tasking deadlock detector, and implemented it.KeywordsAda 2012tasking deadlocksynchronization waiting relationtask waiting for graphrun-time detection

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.