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) = 〈expression〉, 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] denotes the security level of a variable X.
Keywords :
Array; explicit flows; implicit flows; information flow security analysis; lattice; security levels; security model; security policy; specification; Context modeling; Data security; Data structures; Information analysis; Information security; Lattices; Logic; Multidimensional systems; Program processors; Research and development; Array; explicit flows; implicit flows; information flow security analysis; lattice; security levels; security model; security policy; specification;
