FA-54406 / Accessibility interaction semantics / Open access

Ordinary disabled containers disable every descendant · case 01

Ordinary disabled containers disable every descendant.

Verified by executionVariant 1 · 11 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

The fieldset only decision in the disabled inheritance adapter violates its declared contract.

THE FAILURE

The fieldset only decision in the disabled inheritance adapter violates its declared contract.

Unsuccessful approach: The local repair substitutes if (row[4] or ident != query) and row[2] and but still mishandles the regression fixtures.

Case contract

Input preorder nodes [id,parent,native_disabled,aria_disabled,fieldset,first_legend] and queried ID. Native disabled inherits from disabled fieldsets except descendants of their first_legend; nested disabled fieldsets remain independently effective. aria_disabled is tri-state None/True/False and nearest explicit ancestor value wins, but never cancels native disabled. Return [native_effective,aria_effective,effective] for queried node, or None when missing. An explicit native-disabled node remains disabled even when inside an exempt legend. first_legend ID belongs to fieldset; all parent links exist or None.

Why this case matters

Offline accessibility bridge model with explicit policy; useful for testing semantic API adapters independently of browser implementations.

1 / The failure

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(data):
    nodes,query = data
    index = {row[0]:row for row in nodes}
    if query not in index: return None
    chain = []
    current = query
    while current is not None:
        chain.append(current)
        current = index[current][1]
    native = bool(index[query][2])
    aria = None
    for ident in chain:
        row = index[ident]
        if aria is None and row[3] is not None: aria = row[3]
        if row[2] and row[5] not in chain[:chain.index(ident)]: native = True
    aria = False if aria is None else aria
    return [native,aria,native or aria]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('contract fixture 1', solve([[['f',None,True,None,True,'legend'],['legend','f',False,None,False,None],['x','legend',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 2', solve([[['f',None,True,None,True,'legend'],['x','f',False,None,False,None]],'x'],), [True,False,True])
check('contract fixture 3', solve([[['a',None,False,True,False,None],['b','a',False,False,False,None],['x','b',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 4', solve([[['a',None,False,True,False,None],['x','a',True,False,False,None]],'x'],), [True,False,True])
check('contract fixture 5', solve([[['a',None,False,True,False,None],[str(N),'a',False,None,False,None]],str(N)],), [False,True,True])
check('contract fixture 6', solve([[['f',None,True,None,True,'l'],['l','f',False,None,False,None],['nested','l',True,None,True,None],['x','nested',False,None,False,None]],'x'],), [True,False,True])
check('contract fixture 7', solve([[['parent',None,True,None,False,None],['x','parent',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 8', solve([[['f',None,False,None,True,None],['x','f',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 9', solve([[['a',None,False,True,False,None],['b','a',False,None,False,None],['x','b',False,None,False,None]],'x'],), [False,True,True])
check('contract fixture 10', solve([[['n0',None,False,True,False,None]]+[['n'+str(i),'n'+str(i-1),False,None,False,None] for i in range(1,N+3)],'n'+str(N+2)],), [False,True,True])
check('contract fixture 11', solve([[],'missing'],), None)
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
contract fixture 1	`[False, False, False]`	`[False, False, False]`	Passed
contract fixture 2	`[True, False, True]`	`[True, False, True]`	Passed
contract fixture 3	`[False, False, False]`	`[False, False, False]`	Passed
contract fixture 4	`[True, False, True]`	`[True, False, True]`	Passed
contract fixture 5	`[False, True, True]`	`[False, True, True]`	Passed
contract fixture 6	`[True, False, True]`	`[True, False, True]`	Passed
contract fixture 7	`[True, False, True]`	`[False, False, False]`	Failed
contract fixture 8	`[False, False, False]`	`[False, False, False]`	Passed
contract fixture 9	`[False, True, True]`	`[False, True, True]`	Passed
contract fixture 10	`[False, True, True]`	`[False, True, True]`	Passed
contract fixture 11	`None`	`None`	Passed

SHA-256 / 9cc09040fdee6bdeac657cb809c1f12191da8b975c63301fc2d78d59b7448c8d

2 / The unsuccessful fix

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(data):
    nodes,query = data
    index = {row[0]:row for row in nodes}
    if query not in index: return None
    chain = []
    current = query
    while current is not None:
        chain.append(current)
        current = index[current][1]
    native = bool(index[query][2])
    aria = None
    for ident in chain:
        row = index[ident]
        if aria is None and row[3] is not None: aria = row[3]
        if (row[4] or ident != query) and row[2] and row[5] not in chain[:chain.index(ident)]: native = True
    aria = False if aria is None else aria
    return [native,aria,native or aria]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('contract fixture 1', solve([[['f',None,True,None,True,'legend'],['legend','f',False,None,False,None],['x','legend',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 2', solve([[['f',None,True,None,True,'legend'],['x','f',False,None,False,None]],'x'],), [True,False,True])
check('contract fixture 3', solve([[['a',None,False,True,False,None],['b','a',False,False,False,None],['x','b',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 4', solve([[['a',None,False,True,False,None],['x','a',True,False,False,None]],'x'],), [True,False,True])
check('contract fixture 5', solve([[['a',None,False,True,False,None],[str(N),'a',False,None,False,None]],str(N)],), [False,True,True])
check('contract fixture 6', solve([[['f',None,True,None,True,'l'],['l','f',False,None,False,None],['nested','l',True,None,True,None],['x','nested',False,None,False,None]],'x'],), [True,False,True])
check('contract fixture 7', solve([[['parent',None,True,None,False,None],['x','parent',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 8', solve([[['f',None,False,None,True,None],['x','f',False,None,False,None]],'x'],), [False,False,False])
check('contract fixture 9', solve([[['a',None,False,True,False,None],['b','a',False,None,False,None],['x','b',False,None,False,None]],'x'],), [False,True,True])
check('contract fixture 10', solve([[['n0',None,False,True,False,None]]+[['n'+str(i),'n'+str(i-1),False,None,False,None] for i in range(1,N+3)],'n'+str(N+2)],), [False,True,True])
check('contract fixture 11', solve([[],'missing'],), None)
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
contract fixture 1	`[False, False, False]`	`[False, False, False]`	Passed
contract fixture 2	`[True, False, True]`	`[True, False, True]`	Passed
contract fixture 3	`[False, False, False]`	`[False, False, False]`	Passed
contract fixture 4	`[True, False, True]`	`[True, False, True]`	Passed
contract fixture 5	`[False, True, True]`	`[False, True, True]`	Passed
contract fixture 6	`[True, False, True]`	`[True, False, True]`	Passed
contract fixture 7	`[True, False, True]`	`[False, False, False]`	Failed
contract fixture 8	`[False, False, False]`	`[False, False, False]`	Passed
contract fixture 9	`[False, True, True]`	`[False, True, True]`	Passed
contract fixture 10	`[False, True, True]`	`[False, True, True]`	Passed
contract fixture 11	`None`	`None`	Passed

SHA-256 / db78dd986ec3b874bcede6de51659af49247b97f26e07e0648ee9f5c1c58c4b5

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 11 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

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

Verification & scope

Stipulated finite adapter contract, not a claim of platform accessibility or ARIA conformance. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.

Observations recorded using Python 3.12.14 at 2026-09-29T14:45:48.413223+00:00.

Case digest / 2fd19d459f7806f56edf103d4a4a15a47ceb97527a13e7b265442f4ea0ce0c58