Research proof index

Converse of slice_contains_reachable: every entity in the level-n slice (the reachable set computed by Entities.sliceAtLevel) is reachable in n steps. Together with reachable_then_mem_slice this gives euid ∈ slice ↔ ReachableIn, the bridge that makes Entities.closedAtLevel decide EntitiesClosedAtLevel.

Main re-authorization soundness theorem: The result of reauthorizing a partial authorization response with concrete request and entities is equivalent to directly authorizing with the concrete request and entities.

If evaluating a record produces a record value containing an attribute, then that attribute existed in the original record, and corresponding expression evaluates to the same value.

Successful evaluation of a well-typed residual should produce a value of corresponding type.

Lemma: evaluating the resourceScope of any policy produces a boolean (and does not error)

satisfiedPolicies succeeds on sufficiently well-formed inputs.