Sciweavers

Share
9 search results - page 1 / 2
» Lock Removal for Concurrent Trace Programs
Sort
View
CAV
2012
Springer
236views Hardware» more  CAV 2012»
9 years 3 months ago
Lock Removal for Concurrent Trace Programs
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...
Vineet Kahlon, Chao Wang
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
11 years 8 months ago
A new approach to parallelising tracing algorithms
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...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
PPOPP
2005
ACM
11 years 7 months ago
Revocable locks for non-blocking programming
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...
Tim Harris, Keir Fraser
ICFEM
2004
Springer
11 years 6 months ago
A General Model for Reachability Testing of Concurrent Programs
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...
Richard H. Carver, Yu Lei
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
11 years 8 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
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...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...
books