Using Coarse-Grained Abstractions to Verify Linearizability on TSO Architectures

Derrick, John; Smith, Graeme; Groves, Lindsay; Dongol, Brijesh

doi:10.1007/978-3-319-13338-6_1

Cited by 3 publications

(2 citation statements)

References 18 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, in [9,10] the behavior of a method starts with call action and ends with flush return action. In such situation the behavior of a library essentially contains sequences of call and flush return actions.…”

Section: Tso-to-tso Linearizabilitymentioning

confidence: 99%

See 1 more Smart Citation

TSO-to-TSO linearizability is undecidable

Wang

2017

Acta Informatica

View full text Add to dashboard Cite

TSO-to-TSO linearizability is a variant of linearizability for concurrent libraries on the total store order (TSO) memory model. It is proved in this paper that TSO-to-TSO linearizability for a bounded number of processes is undecidable. We first show that the trace inclusion problem of a classic-lossy single-channel system, which is known undecidable, can be reduced to the history inclusion problem of specific libraries on the TSO memory model. Based on the equivalence between history inclusion and extended history inclusion for these libraries, we then prove that the extended history inclusion problem of libraries is undecidable on the TSO memory model. By means of extended history inclusion as an equivalent characterization of TSO-to-TSO linearizability, we finally prove that TSO-to-TSO linearizability is undecidable for a bounded number of processes. Additionally, we prove that all variants of history inclusion problems are undecidable on TSO for a bounded number of processes.

show abstract

Section: Tso-to-tso Linearizabilitymentioning

confidence: 99%

“…For example, in [9,10] the behavior of concurrent libraries on TSO are essentially recorded by sequences of call and flush return actions. Based on this variant of history, they propose TSO-linearizability, a variant of linearizability without abstraction theorem, as correctness condition.…”

mentioning

confidence: 99%

TSO-to-TSO linearizability is undecidable

Wang

2017

Acta Informatica

View full text Add to dashboard Cite

show abstract

A Proof Method for Linearizability on TSO Architectures

Derrick

Smith

Groves

et al. 2017

NASA Monographs in Systems and Software Engineering

View full text Add to dashboard Cite

Linearizability on hardware weak memory models

2020

View full text Add to dashboard Cite

Linearizability is a widely accepted notion of correctness for concurrent objects. Recent research has investigated redefining linearizability for particular hardware weak memory models, in particular for TSO. In this paper, we provide an overview of this research and show that such redefinitions of linearizability are not required: under an interpretation of specification behaviour which abstracts from weak memory effects, the standard definition of linearizability is sound and complete on all hardware weak memory models.We prove our result with respect to a definition of object refinement which takes a weak memory model as a parameter. The main consequence of our findings is that we can leverage the range of existing techniques and tools for standard linearizability when verifying concurrent objects running on hardware weak memory models.

show abstract

Using Coarse-Grained Abstractions to Verify Linearizability on TSO Architectures

Cited by 3 publications

References 18 publications

TSO-to-TSO linearizability is undecidable

TSO-to-TSO linearizability is undecidable

A Proof Method for Linearizability on TSO Architectures

Linearizability on hardware weak memory models

Contact Info

Product

Resources

About