Abstract. We propose a type system to ensure the property of nonin-terference 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. More-over, we show how to adapt the type system in order to preserve the noninterference results in the presence of scheduling policies, while re-maining in a nonprobabilistic setting.
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using...
Noninterference is a property of sequential programs that is useful for expressing security policies...
Concurrent objects may o#er services non-uniformly, constraining the acceptance of messages on the ...
AbstractWe propose a type system to ensure the property of noninterference in a system of concurrent...
AbstractWe study the security property of noninterference for a class of synchronous programs called...
Abstract. We perform a formal analysis of compositionality techniques for prov-ing possibilistic non...
AbstractWe address the question of typing noninterference (NI) in the calculus CCS, in such a way th...
We perform a formal analysis of compositionality techniques for proving possibilistic noninterferenc...
We propose a type system to enforce the security property of noninterference in a core reactive lang...
Concurrent programs are hard to design, develop, and debug. It is widely accepted that we lack good ...
Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designin...
Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designin...
. We present a concurrent semantics for concurrent constraint (cc) programming framework with both (...
Noninterference is a property of sequential programs that is useful for expressing security policies...
We perform a formal analysis of compositionality techniques for proving possibilistic noninterferenc...
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using...
Noninterference is a property of sequential programs that is useful for expressing security policies...
Concurrent objects may o#er services non-uniformly, constraining the acceptance of messages on the ...
AbstractWe propose a type system to ensure the property of noninterference in a system of concurrent...
AbstractWe study the security property of noninterference for a class of synchronous programs called...
Abstract. We perform a formal analysis of compositionality techniques for prov-ing possibilistic non...
AbstractWe address the question of typing noninterference (NI) in the calculus CCS, in such a way th...
We perform a formal analysis of compositionality techniques for proving possibilistic noninterferenc...
We propose a type system to enforce the security property of noninterference in a core reactive lang...
Concurrent programs are hard to design, develop, and debug. It is widely accepted that we lack good ...
Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designin...
Mainstream programming idioms intensively rely on state mutation, sharing, and concurrency. Designin...
. We present a concurrent semantics for concurrent constraint (cc) programming framework with both (...
Noninterference is a property of sequential programs that is useful for expressing security policies...
We perform a formal analysis of compositionality techniques for proving possibilistic noninterferenc...
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using...
Noninterference is a property of sequential programs that is useful for expressing security policies...
Concurrent objects may o#er services non-uniformly, constraining the acceptance of messages on the ...