Operational Semantics for the Rigorous Analysis of Distributed Systems

Al-Mahfoudh, Mohammed S.; Gopalakrishnan, Ganesh; Stutsman, Ryan

doi:10.1007/978-3-319-56157-8_10

Cited by 2 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specifically, they target programs running on TSO (Total Store Order) and XC (Relaxed Consistency-cache coherence model) weak memory models. Ozkan et al 64 show ## We highly encourage the reader to read the operational semantics of DS2 32 to realize and appreciate the capabilities there in. A simpler model paper for an overview is in Reference 33 that linearizability of a history is often witnessed/realized by a schedule that re-orders small number of operations (< 5), prioritizing schedules with fewer operations first in the exploration.…”

Section: Related Workmentioning

confidence: 98%

“…As explained in our operational semantics paper, 32 the global state of an actor system is a distributed system state in DS2 terms, and here it is symbolized as

s \in 𝕊

, where

𝕊

is the set of all possible states in a system. Each state

s=\left\langle \alpha, m\right\rangle

is comprised of a map

α : 𝔸 \to 𝕃

where

𝔸

is the set of all possible agents/actors identifiers in the system, and

𝕃

are possible local states .…”

Section: Algorithms In Detailmentioning

confidence: 99%

“…18,[29][30][31] • Extensible and modular implementations of seven algorithms (six of which are stateful), and two of which are new (IRed and LiViola). All of which used only four out of sixteen (programmable) operational semantics rules 32 provided by our framework. 21,33,34 • A detailed comparison of these algorithms used for the first time in the context of linearizability checking instead of simple invariant checking, run side-by-side on the same benchmarks showing how they perform and scale when checking actor systems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient linearizability checking for actor‐based systems

Al‐Mahfoudh,

Stutsman,

Gopalakrishnan

2023

Softw Pract Exp

Self Cite

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

Section: Related Workmentioning

confidence: 98%

“…As explained in our operational semantics paper, 32 the global state of an actor system is a distributed system state in DS2 terms, and here it is symbolized as

s \in 𝕊

, where

𝕊

is the set of all possible states in a system. Each state

s=\left\langle \alpha, m\right\rangle

is comprised of a map

α : 𝔸 \to 𝕃

where

𝔸

is the set of all possible agents/actors identifiers in the system, and

𝕃

are possible local states .…”

Section: Algorithms In Detailmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient linearizability checking for actor‐based systems

Al‐Mahfoudh,

Stutsman,

Gopalakrishnan

2023

Softw Pract Exp

Self Cite

View full text Add to dashboard Cite

show abstract

“…As explained in our operational semantics paper 32 , the global state of an actor system is a distributed system state in DS2 terms, and here it is symbolized as ∈ , where is the set of all possible states in a system. Each state = ⟨ , ⟩ is comprised of a map ∶ → where is the set of all possible agents/actors identifiers in the system, and are possible local states.…”

Section: Notations Terms and Definitionsmentioning

confidence: 99%

“…• Extensible and modular implementations of 7 algorithms (6 of which are stateful 1 ), and two of which are new (IRed and LiViola). All of which used only four out of sixteen (programmable) operational semantics rules 32 provided by our framework 33,21,34 .…”

mentioning

confidence: 99%

Efficient Linearizability Checking for Actor-based Systems

Al-Mahfoudh¹,

Stutsman²,

Gopalakrishnan³

2021

Preprint

Self Cite

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

Operational Semantics for the Rigorous Analysis of Distributed Systems

Cited by 2 publications

References 18 publications

Efficient linearizability checking for actor‐based systems

Efficient linearizability checking for actor‐based systems

Efficient Linearizability Checking for Actor-based Systems

Contact Info

Product

Resources

About