All proofs
Project-declaredLean 4.31.0 · null

Verify Always Allows is complete

Cedar.Thm.verifyAlwaysAllows_is_complete

Plain-language statement

The verifyAlwaysAllows analysis is sound: if the assertions verifyAlwaysAllows ps₁ εnv are satisfiable for the policies ps₁ and the strongly well-formed symbolic environment εnv, then there exists a strongly well-formed concrete environment env ∈ᵢ εnv such that the authorizer will not return allow when applied to ps₁ and env.

Exact Lean statement

theorem verifyAlwaysAllows_is_complete {ps₁ : Policies} {εnv : SymEnv} {asserts : Asserts} :
  εnv.StronglyWellFormedForPolicies ps₁ →
  verifyAlwaysAllows ps₁ εnv = .ok asserts →
  εnv ⊧ asserts →
  ∃ env,
    env ∈ᵢ εnv ∧
    env.StronglyWellFormedForPolicies ps₁ ∧
    Env.EnumCompleteFor env εnv ∧
    ¬ allows (Spec.isAuthorized env.request env.entities ps₁)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem verifyAlwaysAllows_is_complete {ps₁ : Policies} {εnv : SymEnv} {asserts : Asserts} :  εnv.StronglyWellFormedForPolicies ps₁   verifyAlwaysAllows ps₁ εnv = .ok asserts   εnv ⊧ asserts    env,    env ᵢ εnv     env.StronglyWellFormedForPolicies ps₁     Env.EnumCompleteFor env εnv     ¬ allows (Spec.isAuthorized env.request env.entities ps₁):= by  intro hwε₁ hvc hsat  unfold verifyAlwaysAllows at hvc  have env, h := verifyIsAuthorized_is_complete verifyImplies_wbaq    (swf_εnv_for_allowAll_policies hwε₁.left) hwε₁ hvc hsat  exists env  rw [allows_eq_allowAll_implies _ env]  simp [h]
Project
Cedar Specification
License
Apache-2.0
Commit
3f093947b8ae
Source
cedar-lean/Cedar/Thm/Verification.lean:660-676

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.31.0

Find? ext

Cedar.Data.Map.find?_ext

Plain-language statement

Two well-formed maps are equal if they have the same find? for every key.

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Find? notmem keys

Cedar.Data.Map.find?_notmem_keys

Plain-language statement

Inverse of find?_mem_toList, except that this requires wf

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Find? some iff in values

Cedar.Data.Map.find?_some_iff_in_values

Plain-language statement

The mp direction of this does not need the wf precondition and, in fact, is available separately as find?_some_implies_in_values above

authorizationprogram verificationsemantics

Source project: Cedar Specification

Person-level attribution pending.

View proof record