Analysis of Concerns in sort.c

A variety of analysis results have been generated from the concern description database.

A summary of property values is available.

A summary of analyzer usage instructions is available.


Interaction Graph
The following tree diagram indicates the interactions among concerns in sort.c.  Uses relationships are indicated by solid lines; extends relationships are indicated by dashed lines.  Several nodes that carry a cluster of related interactions bundle the nodes into a rectangular clustering node. All members in the clustering node repeat nodes that occur elsewhere on the graph.

Due to the large size of the diagram, I recommend downloading one of the image files(SortTree.ps, SortTree.pdf) to your local machine and printing it on a high resolution laser printer.

Hierarchies
The following hierarchies are defined by the concerns:

Closures
The following closures are derived from the concern definitions:

Line Statistics
The following information on the sizes of each concern are derived from the concern definitions:

Mixing Analysis
The following information about line interactions is derived from the concern definitions

The interaction between all pairs of concerns is handled as a basis concern that is compared to a set of matched concerns. The number of lines in common is listed in parenthesis following each matched concern. (Except when the concerns are disjoint, and the number of common lines is zero by definition.)

The interaction between any two concerns is classified into one of the five following cases:

The cover and subset cases are inverses of each other, with the roles of basis and matched concern reversed. Ths same case has only arisen when a concern is compared with itself. It's also a quick and dirty way to get the line count for each concern.