On the Flow of Data, Information, and Time.
POST(2015)
摘要
We study information flow in a model for data-parallel computing. We show how an extant notion of virtual time can help guarantee information-flow properties. For this purpose, we introduce functions that express dependencies between inputs and outputs at each node in a dataflow graph. Each node may operate over a distinct set of virtual times--so, from a security perspective, it may have its own classification scheme. A coherence criterion ensures that those local dependencies yield global properties.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要