Noninterference for concurrent programs

37Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a type system to ensure the property of noninterference in a system of concurrent programs, described in a standard imperative language extended with parallelism. Our proposal is in the line of some recent work by Irvine, Volpano and Smith. Our type system, as well as our semantics for concurrent programs, seem more natural and less restrictive than those originally presented by these authors. Moreover, we show how to adapt the type system in order to preserve the noninterference results in the presence of scheduling policies, while remaining in a nonprobabilistic setting. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Boudol, G., & Castellani, I. (2001). Noninterference for concurrent programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 382–395). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free