6 citations · 10 across the 3 of their papers we have counts for
3 papers
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…