Checking linearizability with fine-grained traces

Long, Zhenyue; Zhang, Yu

doi:10.1145/2851613.2851774

Cited by 6 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Model checking was applied for linearizability checking, with simplified first-order formulas that can help improve efficiency [5], [14]. Fine-grained traces were introduced in [8] to accelerate linearizability checking.…”

Section: Pairsnapshotmentioning

confidence: 99%

“…VeriTrace [8] is an off-line tool for automated linearizability checking. Given a concurrent object as an input, VeriTrace automatically runs concurrently a couple of threads, each executing a certain number of operations, and records the history H of the concurrent execution on the object.…”

Section: A Basic Implementationmentioning

confidence: 99%

“…ConTeGe [7] can fully automatically produce a large number of small-scale traces, which are composed of operations with random arguments, but may not manifest potential faults. VeriTrace [8] can produce traces that can trigger various buggy executions, but these traces may contain redundant operations, therefore raise the complexity of further analysis unnecessarily.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Localization of Linearizability Faults on the Coarse-grained Level

Zhang¹,

Wu²,

Zhang³

2017

International Conferences on Software Engineering and Knowledge Engineering

Self Cite

View full text Add to dashboard Cite

Abstract-Linearizability is an important correctness criterion that guarantees the safety of concurrent data structures. Due to the nondeterminism of concurrent executions, reproduction and localization of a linearizability fault still remain challenging. The existing work mainly focuses on model checking the thread schedule space of a concurrent program on a fine-grained (state) level, and hence suffers from the severe problem of state space explosion. This paper presents a tool called CGVT to build a small test case that is sufficient enough for reproducing a linearizability fault. Given a possibly long history that has been detected non-linearizable, CGVT first locates the operations causing a linearizability violation, and then synthesizes a short test case for further investigation. Moreover, we present several optimization techniques to improve the effectiveness and efficiency of CGVT. We have applied CGVT to 10 concurrent objects, while the linearizability of some of the concurrent objects is unknown yet. The experiments show that CGVT is powerful and efficient enough to build the test cases adaptable for a fine-grained analysis.

show abstract

Section: Pairsnapshotmentioning

confidence: 99%

Section: A Basic Implementationmentioning

confidence: 99%