Typing Noninterference for Reactive Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Typing Noninterference for Reactive Programs

Abstract

We propose a type system to enforce the security property of noninterference in a core reactive language, obtained by extending the imperative language of Volpano, Smith and Irvine with reactive primitives manipulating broadcast signals and with a form of ``scheduled'' parallelism. Due to the particular nature of reactive computations, the definition of noninterference has to be adapted. We give a formulation of noninterference based on bisimulation. Our type system is inspired by that introduced by Boudol and Castellani, and independently by Smith, to cope with timing leaks in a language for parallel programs with scheduling. We establish the soundness of this type system with respect to our notion of noninterference.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5594.pdf (262.54 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070413 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070413 , version 1

Cite

Ana Almeida Matos, Gérard Boudol, Ilaria Castellani. Typing Noninterference for Reactive Programs. [Research Report] RR-5594, INRIA. 2006, pp.38. ⟨inria-00070413⟩
95 View
232 Download

Share

Gmail Facebook X LinkedIn More