most citedA Better Reduction Theorem for Store Buffers

6 citations · 12 across the 6 of their papers we have counts for

collaborators

6 papers

cs.DC2014★ 1 cited

Coherent Causal Memory

Ernie Cohen

Coherent causal memory (CCM) is causal memory in which prefixes of an execution can be mapped to global memory states in a consistent way. While CCM requires conflicting pairs of w…

cs.LO2014

Hypothesis Elimination in Kleene Semirings

Ernie Cohen

A Kleene semiring is an algebraic structure satisfying the axioms of Kleene algebra, minus the annihilation axioms (x.0 = 0 = 0.x). We show that Kleene semirings (like Kleene algeb…

cs.SE2014★ 1 cited

Modular Verification of Hybrid System Code with VCC

Ernie Cohen

We present a methodology for object-modular reasoning about hybrid system code using VCC, a deductive verifier for concurrent C code. We define in VCC an explicit time model, in wh…

cs.LO2009★ 4 cited

Weak Kleene Algebra is Sound and (Possibly) Complete for Simulation

Ernie Cohen

We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete for the theory of regular expressions modulo simulation equivalence, assuming their completeness for mon…

cs.SE2009

Pessimistic Testing

Ernie Cohen

We propose a new approach to testing conformance to a nondeterministic specification, in which testing proceeds only as long as increased test coverage is guaranteed.

cs.LO2009★ 6 cited

A Better Reduction Theorem for Store Buffers

Ernie Cohen, Norbert Schirmer

When verifying a concurrent program, it is usual to assume that memory is sequentially consistent. However, most modern multiprocessors depend on store buffering for efficiency, an…