Jun 28, 2016 · (CSF 2016) presents a compositional theory of refinement for a value-dependent noninterference property, defined in (Murray, PLAS 2015), for ...
May 26, 2024 · We define a generic locale for capturing refinement between an abstract and a concrete program. We then define and prove sufficient, conditions ...
TL;DR: In this article, the authors present a concurrent theory of information flow security that supports compositional reasoning under dynamic assumptions, ...
Compositional Security-Preserving Refinement for Concurrent Imperative Programs. T Murray, R Sison, E Pierzchalski, C Rizkallah. Archive of Formal Proofs, 2016.
A Dependent Security Type System for Concurrent Imperative Programs · Compositional Security-Preserving Refinement for Concurrent Imperative Programs.
Recent work has demonstrated that per-thread compo- sitional verification of value-dependent noninterference is feasible for concurrent programs: Murray et al.
This compiler translates concurrent programs written in an imperative While language, with locking primitives for mediating access to shared memory, into a RISC ...
To this end, here we present notions of concurrent value-dependent noninterference- preserving refinement, which are compositional across the threads of mixed- ...
Jul 28, 2021 · First, we present notions of refinement that preserve a concurrent value-dependent notion of noninterference that we have designed to support ...
Compositional information flow security for concurrent programs
www.researchgate.net › ... › Security
Oct 22, 2024 · We present a general unwinding framework for the definition of information flow security properties of concurrent programs, described in a ...