.png){kind=icon}
.png){kind=icon}
Return
Noninterference Through Bisimulation
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-99751-8_11.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Noninterference properties state that data does not flow in an undesirable manner, e.g. from a high-security to a low-security setting. Within programming languages noninterference is often enforced through the use of modal type systems. Proving the property often requires nontrivial techniques, such as denotational semantics or logical relations. We show that a simple bisimulation technique (due to Choudhury, Eades, and Weirich) can be adapted to show noninterference for a variety of modal type systems.
Keywords:
lambda calculus
modal type theory
information flow
noninterference
bisimulation
Journal
T
IF:
0
Papers:
20
Citations:
0