FA-11567 / Filesystem semantics / Member archive

Readable directories are mistaken for searchable directories · case 02

Readable directories are mistaken for searchable directories.

Member previewVariant 2 · 3 implementations · 6 checks per implementation

Case contract

Deterministic in-memory filesystem model. Given already-selected permission triples 0..7 for each ancestor, return whether a known file name can be traversed. Search bit 1 is needed at every ancestor; listing bit 4 is irrelevant. Empty ancestors succeeds.

Why this case matters

An offline semantic experiment for file API clients; it models only the stated operations, not a complete operating system.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
search without listing	`false`	`true`	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.