9 search results - page 1 / 2 » Lock Removal for Concurrent Trace Programs |
CAV
2012
Springer
12 years 1 months ago
2012
Springer
Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computati...
IWMM
2009
Springer
14 years 5 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
PPOPP
2005
ACM
14 years 4 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...
ICFEM
2004
Springer
14 years 4 months ago
2004
Springer
Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...
TACAS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...