Elements
graph TD;
%% REQVIRE-AUTOGENERATED-DIAGRAM
%% Graph styling
classDef userRequirement fill:#D1C4E9,stroke:#7E57C2,stroke-width:2px;
classDef systemRequirement fill:#E1D8EE,stroke:#673AB7,stroke-width:1.5px;
classDef verification fill:#DCEDC8,stroke:#4CAF50,stroke-width:2px;
classDef folder fill:#FAFAFA,stroke:#9E9E9E,stroke-width:3px;
classDef file fill:#FFF8E1,stroke:#FFCA28,stroke-width:2px;
classDef default fill:#F5F5F5,stroke:#424242,stroke-width:1.5px;
subgraph e57e8ed6cc4cc063["📁 requirements/Functional/Processing"]
subgraph 1fca82108d7bd4a6["📄 Specifications.md"]
ee8cad76216ab553["Verification Roll-up Specification"];
class ee8cad76216ab553 default;
click ee8cad76216ab553 "Specifications.html#verification-roll-up-specification";
121cd27aa4d9a897["Verification Trace Tree Construction"];
class 121cd27aa4d9a897 default;
click 121cd27aa4d9a897 "Specifications.html#verification-trace-tree-construction";
end
end
Verification Roll-up Specification
Rules for determining verification status of parent requirements based on child verification.
Details
Roll-up Rules:
- When a requirement has children (through derivedFrom relations), it is considered verified if ALL of its child requirements are verified, regardless of whether the parent has direct verifiedBy relations
- When a requirement has no children (leaf requirement), it is considered verified if it has direct verifiedBy relations
- A parent with any unverified child shall be marked as unverified (❌), even if the parent itself has direct verification
- Verification status rolls up from leaf requirements through the entire parent chain to root requirements
Applicability:
This strategy applies to all verification matrices, coverage reports, and trace outputs.
Metadata
Relations
Verification Trace Tree Construction
Algorithm for building upward trace trees from verification elements to root requirements.
Details
Purpose:
Build a tree structure showing how verifications trace upward through the requirement hierarchy to root requirements. Used for trace reports, redundancy detection, and coverage analysis.
Algorithm Steps:
-
Start from verification element
- Input: verification element with
verify relations
-
Get directly verified requirements
- Follow
verify relations to get target requirements
- Mark these as “directly verified” in the tree
-
Traverse upward through derivedFrom
- For each requirement, follow
derivedFrom relations to parent requirements
- Continue recursively until reaching root requirements (no parents)
-
Build tree structure
- Preserve all paths (a requirement may be reached through multiple children)
- Merge common ancestors into single nodes with multiple incoming edges
- Track which nodes are directly verified vs. transitively traced
-
Mark directly verified nodes
- Nodes with direct
verify relations from the verification
- Distinguished from nodes reached only through parent traversal
Virtual Verification Pattern:
For hierarchical relation analysis (not verification-specific), create a virtual verification element connected to all leaf requirements. Apply the same algorithm to detect redundant hierarchical relations.
Usage:
- Trace Report Generator: visualize verification-to-root paths
- Redundant Verify Detection: find ancestors that are both directly and transitively verified
- Redundant Hierarchical Detection: find derivedFrom relations with alternate paths
Metadata
Relations