End-to-end availability policies and noninterference (2005)

Cached

Download Links

by Lantian Zheng , Andrew C. Myers
Venue:Store = Identifier ↦→ (Num ∪ {unbound}) Expression Transition Relations: =⇒A : Exp × Store −→ Num Rule NumR Rule IdentR Rule AOpR Rule BitNotR 〈n, σ〉 =⇒A n =⇒B : BoolExp × Store −→ {0,1} Rule BOpR Rule ROpR Rule LNotR 〈I, σ〉 =⇒A σ(I) 〈E, σ〉 =⇒A n 〈E ′ , σ
Citations:12 - 2 self