Secure Information Flow for a Concurrent Language with Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer Security Year : 2007

Secure Information Flow for a Concurrent Language with Scheduling


Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow type system for a concurrent language featuring primitives for scheduling, and shown that typable programs are non-interfering for a possibilistic notion of non-interference. The development, which constitutes to our best knowledge the first machine-checked account of non-interference for a concurrent language, takes advantage of the proof assistant facilities to structure the proofs about different views of the programming language and to identify the relationships among them and the type system. Our language and type system generalize previous work of Boudol and Castellani, Theoretical Computer Science 281 (2002), 109–130, in particular by including arrays and lifting several convenient but unnecessary conditions in the syntax and type system of the work of Boudol and Castellani. We illustrate the generality of our language and the usefulness of our type system with a medium size example.
Fichier principal
Vignette du fichier
barthe_prensa.pdf (295.29 Ko) Télécharger le fichier

Dates and versions

inria-00097395 , version 1 (10-10-2006)


  • HAL Id : inria-00097395 , version 1


Gilles Barthe, Leonor Prensa Nieto. Secure Information Flow for a Concurrent Language with Scheduling. Journal of Computer Security, 2007, Formal Methods in Security Engineering Workshop (FMSE 04), 16 (6), pp.647 - 689. ⟨inria-00097395⟩
121 View
25725 Download


Gmail Facebook Twitter LinkedIn More