Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CONCUR
2012
Springer
10 years 6 months ago
Linearizability with Ownership Transfer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
Alexey Gotsman, Hongseok Yang
PLDI
2012
ACM
10 years 6 months ago
Dynamic synthesis for relaxed memory models
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
Feng Liu, Nayden Nedev, Nedyalko Prisadnikov, Mart...
ESOP
2012
Springer
10 years 11 months ago
Concurrent Library Correctness on the TSO Memory Model
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
Sebastian Burckhardt, Alexey Gotsman, Madanlal Mus...
ICALP
2011
Springer
11 years 7 months ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang
FCS
2006
12 years 4 months ago
Algorithmic Control in Concurrent Computations
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
Mark Burgin
SPAA
2010
ACM
12 years 8 months ago
Simplifying concurrent algorithms by exploiting hardware transactional memory
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables signi´Čücantly simpler c...
Dave Dice, Yossi Lev, Virendra J. Marathe, Mark Mo...
CONCUR
2007
Springer
12 years 9 months ago
A Marriage of Rely/Guarantee and Separation Logic
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Viktor Vafeiadis, Matthew J. Parkinson
books