All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257

Demo Impl writes Only

CellRefExample.demoImpl_writesOnly

Plain-language statement

The handler writes only the cells declared by demoWrites.

Exact Lean statement

theorem demoImpl_writesOnly :
    QueryImpl.WritesOnlyCells demoImpl demoWrites

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem demoImpl_writesOnly :    QueryImpl.WritesOnlyCells demoImpl demoWrites := by  intro t  cases t with  | touchLog =>      change CellRef.SupportWritesOnly        (logRef.writeM 1 : StateT (Heap DemoCell) ProbComp PUnit) {DemoCell.log}      simpa [demoSpec, demoImpl, demoWrites, logRef] using        CellRef.writeM_supportWritesOnly_single logRef 1  | touchCache =>      change CellRef.SupportWritesOnly        (cacheRef.writeM 1 : StateT (Heap DemoCell) ProbComp PUnit) {DemoCell.cache}      simpa [demoSpec, demoImpl, demoWrites, cacheRef] using        CellRef.writeM_supportWritesOnly_single cacheRef 1  | readFlag =>      change CellRef.SupportWritesOnly        ((do let _  (flagRef.readM : StateT (Heap DemoCell) ProbComp Bool)             pure PUnit.unit) : StateT (Heap DemoCell) ProbComp PUnit) ∅      simpa [demoSpec, demoImpl, demoWrites] using        CellRef.supportWritesOnly_bind          (CellRef.readM_supportWritesOnly_empty (m := ProbComp) flagRef)          (fun _ => CellRef.supportWritesOnly_pure_empty (m := ProbComp) PUnit.unit)
Project
VCVio
License
Apache-2.0
Commit
2ceb2d825ee3
Source
VCVio/StateSeparating/CellRef.lean:1029-1050

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.32.0

Expected Cost Nat eq sum tail probs of pathwise Cost At Most

AddWriterT.expectedCostNat_eq_sum_tail_probs_of_pathwiseCostAtMost

Plain-language statement

Finite tail-sum formula for natural-valued writer cost under a pathwise upper bound. If every execution path of oa incurs cost at most n, then the tail probabilities vanish above n, so the infinite tail sum truncates to Finset.range n.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

IND CPA advantage to Real le sum step signed Advantage Real abs

AsymmEncAlg.IND_CPA_advantage_toReal_le_sum_step_signedAdvantageReal_abs

Plain-language statement

Planned generic one-time-to-many-time lift: bounded multi-query IND-CPA advantage is at most the sum of the extracted one-time signed advantages over the first q fresh LR queries.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record