101 search results - page 2 / 21 » Model Checking of Linearizability of Concurrent List Impleme... |
NFM
2011
12 years 11 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
EUROSYS
2011
ACM
12 years 8 months ago
2011
ACM
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
IFIP
2010
Springer
12 years 11 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
WDAG
2004
Springer
13 years 10 months ago
2004
Springer
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...