The analysis of infeasible concurrent paths of concurrent Ada programs

In an execution of a concurrent Ada program, each task will traverse its own path so that the execution can be seen as involving a set of concurrent paths, referred to as a concurrent path (C-path). The path feasibility problem of concurrent program testing is to identify whether a given C-path is traversable in some execution. A static analysis technique is proposed to address this problem. The technique is based on the analysis of the possible execution order of rendezvous statements within the given C-path. A precede relation is defined to express the execution order of rendezvous statements in a C-path. Several precedence rules and an algorithm are proposed to derive precede relations defined in a C-path. Based on the precede relations and the semantics of Ada, several decision rules are given to identify static infeasible C-paths.<>