Controlling confidential information in concurrent systems is difficult, due to covert channels
resulting from interaction between threads. This problem is exacerbated if threads share …

We present a new algorithm for checking probabilistic noninterference in concurrent
programs. The algorithm, named RLSOD, is based on the Low-Security Observational …

Reasoning about information flow in a concurrent setting is notoriously difficult due in part to
timing channels that may leak sensitive information. In this paper, we present a …

This paper studies information flows via timing channels in the presence of automatic
memory management. We construct a series of example attacks that illustrate that garbage …

We present the foundations for a new dynamic information flow control (IFC) parallel runtime
system, LIO _ PAR. To our knowledge, LIO _ PAR is the first dynamic language-level IFC …

We discuss ideas useful to simulation practitioners when specifying the probability models
used to represent stochastic behavior. Emphasis is on situations in which the classical …

OpenSHMEM Analyzer (OSA) is a compiler-based tool that provides static analysis
forOpenSHMEMprograms. It was developed with the intention of providing feedback to the …

Applications that handle sensitive information need to express and reason about the trust
relationships between security principals. Such reasoning is difficult because the trust …

Cloud service providers are often trusted to be genuine, the damage caused by being
discovered to be attacking their own customers outweighs any benefits such attacks could …

For developers to predict whether their code will leak secrets typically requires analysing the
whole program; for programs that are independently composed of software components by a …