Advanced search    

Search: authors:"Heike Wehrheim"

3 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Brief Announcement: Generalising Concurrent Correctness to Weak Memory

Science, University of Surrey , Guildford , UK 2 Department of Computer Science, University of Sheffield , UK 3 Simon Doherty 4 Heike Wehrheim Department of Computer Science, Paderborn University

Mechanized proofs of opacity: a comparison of two techniques

Software transactional memory (STM) provides programmers with a high-level programming abstraction for synchronization of parallel processes, allowing blocks of codes that execute in an interleaved manner to be treated as atomic blocks. This atomicity property is captured by a correctness criterion called opacity, which relates the behaviour of an STM implementation to those of a...

Proving Opacity of a Pessimistic STM

Transactional Memory (TM) is a high-level programming abstraction for concurrency control that provides programmers with the illusion of atomically executing blocks of code, called transactions. TMs come in two categories, optimistic and pessimistic, where in the latter transactions never abort. While this simplifies the programming model, high-performing pessimistic TMs can be...