Secure information flow for a concurrent language with scheduling

Issue title: Formal Methods in Security Engineering Workshop (FMSE 04)

Article type: Research Article

Authors: Barthe, Gilles^a | Prensa Nieto, Leonor^{b; *}

Affiliations: [a] INRIA Sophia-Antipolis, France. E-mail: [email protected] | [b] LORIA, France. E-mail: [email protected]

Correspondence: [*] Corresponding author.

Abstract: 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.

DOI: 10.3233/JCS-2007-15604

Journal: Journal of Computer Security, vol. 15, no. 6, pp. 647-689, 2007