On the Flow of Data, Information, and Time

  • Martin Abadi ,
  • Michael Isard

Published by Springer

We study information ow in a model for data-parallel computing. We show how an extant notion of virtual time can help guarantee information- ow properties. For this purpose, we introduce functions that express dependencies between inputs and outputs at each node in a data ow 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.