All proofs
Project-declaredLean 4.31.0 · null

Verify Evaluate Opt eqv verify Evaluate ok

Cedar.Thm.verifyEvaluateOpt_eqv_verifyEvaluate_ok

Project documentation

This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyEvaluate and verifyEvaluateOpt are equivalent.

Exact Lean statement

theorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : CompiledPolicy} {Γ : Validation.TypeEnv} {φ : Term → Term} :
  CompiledPolicy.compile p Γ = .ok cp →
  wellTypedPolicy p Γ = .ok wp →
  verifyEvaluate φ wp (SymEnv.ofTypeEnv Γ) ~ .ok (verifyEvaluateOpt φ cp)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem verifyEvaluateOpt_eqv_verifyEvaluate_ok {p wp : Policy} {cp : CompiledPolicy} {Γ : Validation.TypeEnv} {φ : Term  Term} :  CompiledPolicy.compile p Γ = .ok cp   wellTypedPolicy p Γ = .ok wp   verifyEvaluate φ wp (SymEnv.ofTypeEnv Γ) ~ .ok (verifyEvaluateOpt φ cp):= by  simp [verifyEvaluate, verifyEvaluateOpt, ResultAssertsEquiv]  intro h₀ h₁  simp [enforceCompiledPolicy_eqv_enforce_ok h₀ h₁]  cases h₂ : compile wp.toExpr (SymEnv.ofTypeEnv Γ) <;> simp  case error e =>    simp only [CompiledPolicy.compile, Except.mapError, h₁, Except.bind_ok] at h₀    rw [Opt.compile.correctness] at h₀    simp [h₂] at h₀  case ok t =>    have h₃ := (cp_compile_produces_the_right_term h₀ h₁).symm ; simp [h₂] at h₃ ; subst t    split <;> rename_i hnot    · apply Asserts.Equiv.constantFalse <;> simp [hnot]    · apply Asserts.Equiv.rfl
Project
Cedar Specification
License
Apache-2.0
Commit
3f093947b8ae
Source
cedar-lean/Cedar/Thm/SymCC/Opt/Verifier.lean:37-54

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