Results 1 
2 of
2
Proving information flow noninterference by reusing a machinechecked correctness proof for slicing
 In 6th International Verification Workshop  VERIFY2010
"... We present a machinechecked correctness proof for information flow noninterference based on interprocedural slicing. It reuses a correctness proof of the contextsensitive interprocedural slicing algorithm of Horwitz, Reps, and Binkley. The underlying slicing framework is modular in the programming ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
We present a machinechecked correctness proof for information flow noninterference based on interprocedural slicing. It reuses a correctness proof of the contextsensitive interprocedural slicing algorithm of Horwitz, Reps, and Binkley. The underlying slicing framework is modular in the programming language used; by instantiating this framework the correctness proofs hold for the respective language, without reproving anything in the correctness proofs for slicing and noninterference. We present instantiations with two different languages to show the applicability of the framework, and thus a verified noninterference algorithm for these languages. The formalization and proofs are conducted in the proof assistant Isabelle/HOL. 1
Slicing Guarantees Information Flow Noninterference
, 2013
"... In this contribution, we show how correctness proofs for intra [7] and interprocedural slicing [8] 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 fu ..."
Abstract
 Add to MetaCart
(Show Context)
In this contribution, we show how correctness proofs for intra [7] and interprocedural slicing [8] 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 [9]. 1