FA-11514 / Static analysis soundness / Member archive

An ambiguous pointer store kills possible old values · case 04

An ambiguous pointer store kills possible old values.

Member previewVariant 4 · 3 implementations · 6 checks per implementation

Case contract

Heap maps allocated object names to possible integer values. Every target must name an allocated object already present in the heap; dangling targets are outside this model. Store a known value through a list of possible targets: unique target replaces, multiple targets union, empty target list changes nothing. Return sorted value lists.

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
ambiguous store	`{"a": [6], "b": [6]}`	`{"a": [0, 6], "b": [1, 6]}`	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.