We define a Concurrent Separation Logic with first-class locks and threads for the C language, and prove its soundness in Coq with respect to a compilable operataional semantics. We define the language Concurrent C minor, an extension of the C minor language of Leroy. C minor was designed as the highest-level intermediate language in the CompCert certified ANSI C compiler, and we add to it lock...

For every k, an oracle Turing machine M k , and rational polytopes P k (S) for all n and S f0; 1g n , are constructed; querying from the set S given as an oracle, M S k solves the separation problem over P k (S) in strongly polynomial time, performing O(n 3k) arithmetic operations. Each of the polytopes P k (S) approximates S in the sense P k (S) \ f0; 1g n = S and P k (S) 0; 1] n , and for all...

We describe the design and implementation of Privacy Oracle, a system that reports on application leaks of user information via the network traffic that they send. Privacy Oracle treats each application as a black box, without access to either its internal structure or communication protocols. This means that it can be used over a broad range of applications and information leaks (i.e., not onl...

Overview Businesses world wide rely on network connectivity in order to service clients, disruption in network services can lead to loss of revenue, and loss of productivity. Business continuity and minimizing planned downtime involves ensuring that the application and systems are designed for resilient to failures. Highly available networking infrastructure could be leveraged by configuring mu...

Test designers widely believe that the overall effectiveness and cost of software testing depends largely on the type and number of test cases executed on the software. In this paper we show that the test oracle used during testing also contributes significantly to test effectiveness and cost. A test oracle is a mechanism that determines whether a software executed correctly for a test case. We...

It is shown how—based on the idea of the Heuristic Oracle—a Statistical Oracle can be implemented based on statistical tests. Whereas the decision of a Heuristic Oracle may be wrong, it will be demonstrated how this can be avoided with the Statistical Oracle, using techniques from the field of randomized algorithms. As with all types of oracles, the Statistical Oracle is not universially applic...

We introduce a variant of the random oracle model where oracledependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain information about the random oracle. Using simple examples we show that this model should be preferred over the classical variant where the auxiliary input is independent of the random oracle. In the presence of oracle-depend...

• Real-time analysis and diagnosis of performance • Pre-configured solution streamlines deployment • Single vendor support Key Advantages of the Oracle ZFS Storage ZS3-BA • Application engineered storage specifically designed for Oracle engineered systems and other Oracle platforms, including unique integration with Oracle Database • High performance dramatically reduces backup windows and rest...

As we discussed in the previous lecture, a cryptographic scheme defined in the random oracle model is allowed to use a random function H : {0, 1} → {0, 1} which is known to all the parties. In an implementation, usually a cryptographic hash function replaces the random oracle. In general, the fact that a scheme is proved secure in the random oracle model does not imply that it is secure when th...