Security Information Flow in Multidimensional Arrays

  • Authors:
  • S. M. Kramer;D. P. Sidhu

  • Affiliations:
  • Mitre Corporation;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1983

Quantified Score

Hi-index 14.98

Visualization

Abstract

The problem of security flow into n-dimensional arrays is considered. It is shown that in the security flow analysis for an array assignment A(B1, B2···,Bn) = , it is sufficient to analyze the flows Bj? A( B1, B2,··· Bn), i.e., show that L[Bj]= L[A(B1, B2,···,Bn)], where L[X] d