Source-pinned research
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 200 research declarations. Search 10,000 more complete Mathlib declarations.
200 results
Clear filtersCedar.Thm.verifyEvaluatePairOpt_eqv_verifyEvaluatePair_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyEvaluatePair and verifyEvaluatePairOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyImplies_is_ok_and_complete
Plain-language statement
Concrete version of verifyImplies_is_complete.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyImplies_is_ok_and_sound
Plain-language statement
Concrete version of verifyImplies_is_sound.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyIsAuthorizedOpt_eqv_verifyIsAuthorized_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyIsAuthorized and verifyIsAuthorizedOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyMatchesDisjoint_is_complete
Plain-language statement
The verifyMatchesDisjoint analysis is complete: if the assertions verifyMatchesDisjoint p₁ p₂ εnv are satisfiable for the policies p₁ and p₂ and the strongly well-formed symbolic environment εnv, then there exists a strongly well-formed concrete environment env ∈ᵢ εnv such that both policies match in env.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyMatchesDisjoint_is_ok_and_complete
Plain-language statement
Concrete version of verifyMatchesDisjoint_is_complete.
Source project: Cedar Specification
Person-level attribution pending.