365 search results - page 4 / 73 » Types for Safe Locking |
PLDI
2010
ACM
14 years 27 days ago
2010
ACM
VLDB
1994
ACM
14 years 26 days ago
1994
ACM
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
CASCON
2004
13 years 10 months ago
2004
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
PPOPP
2005
ACM
14 years 2 months ago
2005
ACM
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...