Static serializability analysis for causal consistency

Brutschy, Lucas; Dimitrov, Dimitar; Müller, Péter; Vechev, Martin

doi:10.1145/3192366.3192415

Cited by 24 publications

(25 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For shared memory distributed systems, robustness of transactional programs against serializability was studied in [Beillahi et al 2019a,b;Bernardi and Gotsman 2016;Brutschy et al 2018;Fekete et al 2005;Nagar and Jagannathan 2018]. Except for [Beillahi et al 2019a,b], these papers do not provide precise verification methods, but rather practical over-approximations.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Verifying observational robustness against a c11-style memory model

Margalit

Lahav

2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We study the problem of verifying the robustness of concurrent programs against a C11-style memory model that includes relaxed accesses and release/acquire accesses and fences, and show that this verification problem can be reduced to a standard reachability problem under sequential consistency. We further observe that existing robustness notions do not allow the verification of programs that use speculative reads as in the sequence lock mechanism, and introduce a novel "observational robustness" property that fills this gap. In turn, we show how to soundly check for observational robustness. We have implemented our method and applied it to several challenging concurrent algorithms, demonstrating the applicability of our approach. To the best of our knowledge, this is the first method for verifying robustness against a programming language concurrency model that includes relaxed accesses and release/acquire fences.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

Verifying observational robustness against a c11-style memory model

Margalit

Lahav

2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Verifying applications under weak consistency has received significant attention in recent years. A number of efforts [2,19,23,25,38] have looked at the problem of verifying arbitrary safety invariants while others have considered verification with respect to distributed database applications and specific high-level transactional properties [5][6][7]10,30,35]. These results are orthogonal to the work described here, since neither consider the question of safely migrating performant concurrent libraries to a replicated environment.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems

Nagar

Mukherjee

Jagannathan

2020

Computer Aided Verification

View full text Add to dashboard Cite

Geo-replicated systems provide a number of desirable properties such as globally low latency, high availability, scalability, and built-in fault tolerance. Unfortunately, programming correct applications on top of such systems has proven to be very challenging, in large part because of the weak consistency guarantees they offer. These complexities are exacerbated when we try to adapt existing highly-performant concurrent libraries developed for shared-memory environments to this setting. The use of these libraries, developed with performance and scalability in mind, is highly desirable. But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naïvely transplant criteria such as linearizability that has a useful interpretation in a shared-memory context to a distributed one where the cost of imposing a (logical) global ordering on all actions is prohibitive. In this paper, we tackle these issues by proposing appropriate semantics and specifications for highly-concurrent libraries in a weakly-consistent, replicated setting. We use these specifications to develop a static analysis framework that can automatically detect correctness violations of library implementations parameterized with respect to the different consistency policies provided by the underlying system. We use our framework to analyze the behavior of a number of highly non-trivial library implementations of stacks, queues, and exchangers. Our results provide the first demonstration that automated correctness checking of concurrent libraries in a weakly geo-replicated setting is both feasible and practical.

show abstract

“…Finally, robustness was also studied, e.g., in [15,20,28,47], in the context of distributed systems, where SC is replaced by serializability. Unlike the current work, these works are focused on practical over-approximations, and do not provide provably precise general verification methods.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

Robustness against release/acquire semantics

Lahav

Margalit

2019

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

We present an algorithm for automatically checking robustness of concurrent programs against C/C++11 release/acquire semantics, namely verifying that all program behaviors under release/acquire are allowed by sequential consistency. Our approach reduces robustness verification to a reachability problem under (instrumented) sequential consistency. We have implemented our algorithm in a prototype tool called Rocker and applied it to several challenging concurrent algorithms. To the best of our knowledge, this is the first precise method for verifying robustness against a high-level programming language weak memory semantics.

show abstract

Static serializability analysis for causal consistency

Cited by 24 publications

References 28 publications

Verifying observational robustness against a c11-style memory model

Verifying observational robustness against a c11-style memory model

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems

Robustness against release/acquire semantics

Contact Info

Product

Resources

About