A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Making lock-free data structures verifiable with artificial transactions
2015
Proceedings of the 8th Workshop on Programming Languages and Operating Systems - PLOS '15
Among all classes of parallel programming abstractions, lock-free data structures are considered one of the most scalable and efficient because of their fine-grained style of synchronization. However, they are also challenging for developers and tools to verify because of the huge number of possible interleavings that result from fine-grained synchronizations. This paper address this fundamental problem between performance and verifiability of lock-free data structures. We present TXIT, a
doi:10.1145/2818302.2818309
dblp:conf/sosp/YuanWYS15
fatcat:62beyourzva45jmvja35jzd5ue