In this paper we consider the problem of verifying trace-based information flow properties for different classes of system models. We begin by proposing an automata-theoretic te...
Deepak D'Souza, Raveendra Holla, K. R. Raghavendra...
Abstract. We develop a language-based approach for modeling and verifying aspects of privacy policies. Our approach relies on information-flow control. Concretely, we use the prog...
Abstract-- Service descriptions based on type hiernd abstract service states ruling the availability of operations permit more secure service combinations in distributed systems de...
We propose two extensions to the SQL grant/revoke security model. In SQL, grants are unconditional, so the grantor must simply trust the recipient's discretion. We allow a gr...
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...