Using program dependence graphs for information flow control
Abstract An algorithm that uses program dependence graphs for static program analysis to validate secure information flow is presented. The algorithm is able to deal with a wider class of information flow policies than the well-known lattice model of secure information flow. The lattice model requires that the information flow permitted by a flow policy be transitive and unidirectional; the algorithm presented here does not impose these restrictions on a flow policy.