Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 350 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

350 results

Clear filters
Project-declaredLean 4.31.0

Batched authorize decision eq authorize

Cedar.Thm.batched_authorize_decision_eq_authorize

Project documentation

The main correctness theorem for batched authorization: If the batched authorizer reaches a definitive decision, that decision agrees with the concrete authorizer. Request and policy well-typedness are checked by batchedAuthorize, so we do not need those as an explicit precondition. We do need entity to explicitly require well-typed entities because `ba...

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Batched evaluate eq evaluate

Cedar.Thm.batched_evaluate_eq_evaluate

Project documentation

The main correctness theorem for batched evaluation: Batched evaluation with an entity loader produces the same result as normal evaluation with the complete entity store.

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Checked eval entity reachable

Cedar.Thm.checked_eval_entity_reachable

Plain-language statement

If an expression checks at level n and then evaluates an entity (or a record containing an entity), then that entity must reachable in n + 1 steps.

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record