FA-11533 / Static analysis soundness / Member archive

A single dataflow sweep misses facts across backward edges · case 03

A single dataflow sweep misses facts across backward edges.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

Given node count, directed edges, and per-node seed labels, return the sorted labels reachable at each node, including seeds; compute the least union fixed point.

Why this case matters

A deterministic offline analysis model exposing a specific soundness or precision boundary; it does not implement a complete language analyzer.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
three reverse dependencies	`[["d3"], ["d3"], [], []]`	`[["d3"], ["d3"], ["d3"], ["d3"]]`	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.