Tasking Deadlocks Research Articles

Queue Operation Related Tasking Deadlocks in Ada 2012 Programs

This article presents some queue operation related tasking deadlocks in Ada 2012 programs.

An Approach for Description of Computer Network Defense Scheme and Its Simulation Verification

In order to solve the problem of which the existing defense policy description languages can only describe some aspects of defense, such as protection or detection, but cannot express relationship among actions and to cope with large-scale network attack, we proposed an approach for description of computer network defense scheme and its simulation verification. A computer network defense-oriented scheme description language (CNDSDL) was designed to describe actions of protection (i.e., access control, encryption communication, backup), detection (i.e., intrusion detection, vulnerability detection), analysis (i.e., log auditing), response (i.e., system rebooting, shutdown), recovery (i.e., rebuild, patch making), and relationship among actions (i.e., sequence-and, sequence-or, concurrent-and, concurrent-or, and xor). The Extend Backus-Naur Form (EBNF) of CNDSDL was provided. At last, we provided an implementation mechanism of CNDSDL. A task deadlock detection algorithm was given for the defense scheme. The simulation was completed in simulation platform of GTNetS. Three simulation experiments verified the description capability and effectiveness of CNDSDL. The results of the experiments show that the defense scheme described by CNDSDL can be transformed to detailed technique rules and realize the defense effect of expression.

New types of tasking deadlocks in Ada 2012 programs

This article presents some new types of tasking deadlocks concerning the new synchronization waiting relations defined in Ada 2012.

Tasking deadlocks in programs with the full Ada 95

This article presents some examples of tasking deadlocks concerning tasking synchronization waiting relations defined in Ada 95's Real-Time Systems Annex.

An application of Petri net reduction for Ada tasking deadlock analysis

As part of our continuing research on using Petri nets to support automated analysis of Ada tasking behavior, we have investigated the application of Petri net reduction for deadlock analysis. Although reachability analysis is an important method to detect deadlocks, it is in general inefficient or even intractable. Net reduction can aid the analysis by reducing the size of the net while preserving relevant properties. We introduce a number of reduction rules and show how they can be applied to Ada nets, which are automatically generated Petri net models of Ada tasking. We define a reduction process and a method by which a useful description of a detected deadlock state can be obtained from the reduced net's information. A reduction tool and experimental results from applying the reduction process are discussed.

A survey of tasking deadlock detection methods

A survey of tasking deadlock detection methods

A classification of tasking deadlocks

A classification of tasking deadlocks