A Tasking deadlock detector for Ada programs

Jingde Cheng, Yoshiaki Kasahara, Kazuo Ushijima

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)

    Abstract

    Tasking deadlocks are one of the most serious and complex problems in concurrent systems with Ada. Until now no methods and tools proposed in recent years can correctly detect all types of tasking deadlocks in any arbitrary Ada program. This paper presents a tasking deadlock detector for Ada programs. The tool works by monitoring the tasking behavior of a target program and operating a Task-Wait-For Graph for the program. It can detect all types of tasking deadlocks in a class of Ada programs. We describe the principle of detecting tasking deadlocks dynamically, present our implementation of the tool, and give a real example of using the tool to detect a complex tasking deadlock.

    Original languageEnglish
    Title of host publicationProceedings of the15th Annual International Computer Software and Applications Conference, CMPSAC 1991
    PublisherIEEE Computer Society
    Pages56-63
    Number of pages8
    ISBN (Electronic)0818621524
    DOIs
    Publication statusPublished - Jan 1 1991
    Event15th Annual International Computer Software and Applications Conference, CMPSAC 1991 - Tokyo, Japan
    Duration: Sep 11 1991Sep 13 1991

    Publication series

    NameProceedings - International Computer Software and Applications Conference
    ISSN (Print)0730-3157

    Conference

    Conference15th Annual International Computer Software and Applications Conference, CMPSAC 1991
    CountryJapan
    CityTokyo
    Period9/11/919/13/91

    All Science Journal Classification (ASJC) codes

    • Software
    • Computer Science Applications

    Fingerprint Dive into the research topics of 'A Tasking deadlock detector for Ada programs'. Together they form a unique fingerprint.

    Cite this