Sciweavers

41 search results - page 2 / 9
» Reasoning about Lock Placements
Sort
View
FCSC
2010
170views more  FCSC 2010»
13 years 3 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
APLAS
2007
ACM
13 years 9 months ago
Local Reasoning for Storable Locks and Threads
We present a resource oriented program logic that is able to reason about concurrent heap-manipulating programs with unbounded numbers of dynamically-allocated locks and threads. T...
Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rin...
PODS
1990
ACM
150views Database» more  PODS 1990»
13 years 9 months ago
On Being Optimistic about Real-Time Constraints
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
Jayant R. Haritsa, Michael J. Carey, Miron Livny
CAV
2008
Springer
130views Hardware» more  CAV 2008»
13 years 7 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
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...
Naoki Kobayashi, Davide Sangiorgi