Round-up: Runtime checking quasi linearizability of concurrent data structures

Zhang, Lu; Chattopadhyay, Arijit; Wang, Chao

doi:10.1109/ase.2013.6693061

Cited by 11 publications

(5 citation statements)

References 46 publications

(53 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Quasi linearizability. Zhang et al 78 on runtime checking for quasi linearizability . This is a more relaxed form of linearizability.…”

Section: Related Workmentioning

confidence: 99%

Efficient linearizability checking for actor‐based systems

Al‐Mahfoudh,

Stutsman,

Gopalakrishnan

2023

Softw Pract Exp

View full text Add to dashboard Cite

Recent demand for distributed software had led to a surge in popularity in actor‐based frameworks. However, even with the stylized message passing model of actors, writing correct distributed software is still difficult. We present our work on linearizability checking in DS2, an integrated framework for specifying, synthesizing, and testing distributed actor systems. The key insight of our approach is that often subcomponents of distributed actor systems represent common algorithms or data structures (e.g., a distributed hash table or tree) that can be validated against a simple sequential model of the system. This makes it easy for developers to validate their concurrent actor systems without complex specifications. DS2 automatically explores the concurrent schedules that system could arrive at, and it compares observed output of the system to ensure it is equivalent to what the sequential implementation could have produced. We describe DS2's linearizability checking and test it on several concurrent replication algorithms from the literature. We explore in detail how different algorithms for enumerating the model schedule space fare in finding bugs in actor systems, and we present our own refinements on algorithms for exploring actor system schedules that we show are effective in finding bugs.

show abstract

“…Quasi linearizability. Zhang et al 78 on runtime checking for quasi linearizability . This is a more relaxed form of linearizability.…”

Section: Related Workmentioning

confidence: 99%

Efficient linearizability checking for actor‐based systems

Al‐Mahfoudh,

Stutsman,

Gopalakrishnan

2023

Softw Pract Exp

View full text Add to dashboard Cite

show abstract

“…Zhang et al 60 on runtime checking for quasi linearizability. This is a more relaxed form of linearizability.…”

Section: Related Workmentioning

confidence: 99%

Efficient Linearizability Checking for Actor-based Systems

Al-Mahfoudh¹,

Stutsman²,

Gopalakrishnan³

2021

Preprint

View full text Add to dashboard Cite

Recent demand for distributed software had led to a surge in popularity in actorbased frameworks. However, even with the stylized message passing model of actors, writing correct distributed software is still difficult. We present our work on linearizability checking in DS2, an integrated framework for specifying, synthesizing, and testing distributed actor systems. The key insight of our approach is that often subcomponents of distributed actor systems represent common algorithms or data structures (e.g. a distributed hash table or tree) that can be validated against a simple sequential model of the system. This makes it easy for developers to validate their concurrent actor systems without complex specifications. DS2 automatically explores the concurrent schedules that system could arrive at, and it compares observed output of the system to ensure it is equivalent to what the sequential implementation could have produced. We describe DS2's linearizability checking and test it on several concurrent replication algorithms from the literature. We explore in detail how different algorithms for enumerating the model schedule space fare in finding bugs in actor systems, and we present our own refinements on algorithms for exploring actor system schedules that we show are effective in finding bugs.

show abstract

“…Concurrency bug detectors [23,24,35,30,33,44,34] focus on exposing the failures. In contrast, this work focuses on preventing concurrency failures by perturbing the thread interleaving -failures would not occur at run time even if the program is buggy.…”

Section: Related Workmentioning

confidence: 99%

Runtime prevention of concurrency related type-state violations in multithreaded applications

Zhang

Wang

2014

Proceedings of the 2014 International Symposium on Software Testing and Analysis

Self Cite

View full text Add to dashboard Cite

We propose a new method for runtime prevention of type state violations in multithreaded applications due to erroneous thread interleavings. The new method employs a combination of static and dynamic program analysis techniques to control the execution order of the method calls to suppress illegal call sequences. The legal behavior of a shared object is specified by a type-state automaton, which serves as the guidance for our method to delay certain method calls at run time. Our main contribution is a new theoretical framework for ensuring that the runtime prevention strategy is always safe, i.e., they do not introduce new erroneous interleavings. Furthermore, whenever the static program analysis is precise enough, our method guarantees to steer the program to a failurefree interleaving as long as such interleaving exists. We have implemented the new method in a tool based on the LLVM compiler framework. Our experiments on a set of multithreaded C/C++ applications show that the method is both efficient and effective in suppressing concurrency related type-state violations.

show abstract

Round-up: Runtime checking quasi linearizability of concurrent data structures

Cited by 11 publications

References 46 publications

Efficient linearizability checking for actor‐based systems

Efficient linearizability checking for actor‐based systems

Efficient Linearizability Checking for Actor-based Systems

Runtime prevention of concurrency related type-state violations in multithreaded applications

Contact Info

Product

Resources

About