Secure information flow via linear continuations. Higher Order and Symbolic Computation, 15(2–3), 2002. Auxiliary Lemmas In this section we provide, without proof (see [10] for full proofs), a series of lemmas used in the proofs of the main results. Lemma (0)

by S Zdancewic, A Myers
Venue:pc〉Ξ → {}) l then (a) w = L (b) H(L) = B (c) Ξ[pc] ✄Ψ B blk Lemma A.6 (Canonical Forms) If ✄H : Ψ heap, ✄ΨR : Γ regFile and Γ ✄Ψ v : σ opnd, then: 1. if σ = int l then ˆ R(v) = i l 2. if σ = 〈σ0, . . . , σn−1〉 l then (a) ˆ R(v) = p (b) H(p) = 〈w0, . . . ,