Topic · verification chain

Verification chain

Gist

A verification chain is the parent-to-child hop: if the parent is verified, every live child must be verified too. Proof runs proof gaps specs/system --check verification_chain. A green parent is not a chain. Jama still authors.

proof gaps specs/system --check verification_chain

Keep the suite if it already fails on a broken fixture. Keep Jama if it already holds the shalls. Neither one names the child that never ran after the parent went green.

Request demo Last green parent vs this stamp

01 · The parent that stopped halfway

A realizable parent is not a verified tree.

You can prove SYS-REQ-010 and still have never asked whether SYS-REQ-011, the child you just added, ran realizability, consistency, or vacuity.

The check walks explicit hierarchy only. parent on the child YAML is the edge. Cross-cutting satisfies links are refinement traces. They do not create a chain obligation. Retired and superseded nodes are skipped. If the parent itself is not verified, there is no chain to inspect, and the children are not findings.

A child counts as verified when any one arm is true: realizability, consistency, or vacuity. That is an OR. A child that only passed vacuity satisfies the chain. The missing realizability arm is not a finding on this hop. The audit check id is verification_chain_complete. The gaps flag is verification_chain.

The ordered pipeline lives on software verification as proof verify. The id list lives on requirements completeness. This hop is the broken edge, not the pipeline and not a missing SYS-REQ id.

proof gaps specs/system --check verification_chain
proof audit --check verification_chain_complete --verbose
proof workflow check --stage verify --verbose

Inspect the named pair before you edit. The finding carries parent_id, child_id, and the missing arm when the child is still unverified. Do not mark the child verified to clear the stamp. Run the arm that the child actually owes, then rerun the same check.

02 · The exhibit

Same graph. A green parent, or this stamp.

SYS-REQ-010 still realizes. Click the tabs.

The parent

Ask did SYS-REQ-010 realize
Count parent green, two children never ran
Why the suite never walked the tree

Stamp green

This hop

No verification_chain JSON. The parent-to-child edge never ran.

No stamp

The parent

Keep the realizability verdict. It still owns that shall. That is not this hop.

Keep the parent

Proof

Ask did every live child run after the parent
Out SYS-REQ-010 → SYS-REQ-011, child unverified

Incomplete chain is named

Same graph. A green parent, or this stamp. Click the tabs.

Surface	What they do	What Proof does	What we lose
Green suite / CI	The tests you selected passed.	Fail when a verified parent has an unverified live child.	We do not run the child's solver for you. A green stamp is not a proof of the Go.
Software verification	The ordered pipeline on this change.	The parent-to-child edge inside that graph.	Not that hop. See software verification.
Requirements completeness	Whether L0 / L1 / L2 ids exist.	Whether verification actually reached the children.	Not that hop. See requirements completeness.
Jama	The authoring programme. Reviews if you put them there.	Fail the merge when the chain stops halfway.	Not Jama's V&V. Jama still authors. We have not run a frozen Jama pack.

The teaching graph is still one parent next to its children. Run the check. Read the pair. Formalize or verify the child, or retire it. Do not delete the parent field to clear the stamp. Satisfies-only links stay traces. They are not this hop.

proof realize specs/system autopilot
proof audit --check verification_chain_complete --verbose
proof gaps specs/system --check verification_chain

The pipeline stays on software verification. A child that only passed vacuity still satisfies this OR. Jama still authors. Proof vs Jama.

03 · The honest loss

Proof names the broken edge. It does not verify the child.

A green verification_chain is parent-to-child agreement. It is not a proof of the Go. Jama still authors.

The check does not run realizability, consistency, or vacuity. It reads the fields those arms already wrote. An OR means one arm is enough. A child with only vacuity is a complete chain here and can still be a vacuous shall. Unverified parents are skipped, so an unverified tree produces no findings. Satisfies links are ignored. We have not scored this graph against a frozen Jama pack or a second human's V&V judgment. The loss is named, not scored.

The pipeline stays on software verification. The engagement stays on software correctness audit. Jama still authors.

Request demo How the install is bought

04 · Nearby questions

What people type next.

What is a verification chain? Same question. Same URL.

Is this software verification? No. That hop is the ordered pipeline. This hop is the parent-to-child edge. See software verification.

Is this requirements completeness? No. That hop is whether L0 / L1 / L2 ids exist. See requirements completeness.

Is this catalog completeness? No. That hop is obligation class drift. See catalog completeness.

Is Proof a Jama alternative for the chain? No. Jama still authors. Proof vs Jama.