FA-11405 / Accessibility interaction semantics / Member archive

A global recursion guard erases a repeated label branch · case 05

Shared text is lost in a label-reference graph, or a cycle prevents termination.

Member previewVariant 5 · 3 implementations · 6 checks per implementation

Case contract

Controlled label graph: each node has [local_text,ordered_reference_ids]. Resolve the root by concatenating its local text and recursively resolved references with spaces, omitting missing nodes and edges to path ancestors. Shared nodes contribute once per path. Graph size is bounded by fixtures.

Why this case matters

A controlled offline accessibility-data model. It isolates the stated contract; it does not simulate browser accessibility APIs or claim full ARIA conformance.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
self cycle	`"5 5"`	`"5"`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.