In this contribution, we show how correctness proofs for intra- and interprocedural slicing can be used to prove that slicing is able to guarantee information flow noninterference. Moreover, we also illustrate how to lift the control flow graphs of the respective frameworks such that they fulfil the additional assumptions needed in the noninterference proofs. A detailed description of the intraprocedural proof and its interplay with the slicing framework can be found in the PLAS'09 paper by Wasserrab et al.
This entry contains the part for inter-procedural slicing. See entry InformationFlowSlicing for the intra-procedural part.
[2016-06-10] The original entry InformationFlowSlicing contained both the inter- and intra-procedural case was split into two for easier maintenance.