TSO to SC via Symbolic Execution

@inproceedings{Wehrheim2015TSOTS,
  title={TSO to SC via Symbolic Execution},
  author={Heike Wehrheim and Oleg Travkin},
  booktitle={Haifa Verification Conference},
  year={2015}
}
Modern multi-core processors equipped with weak memory models like TSO exhibit executions which – due to store buffers – seemingly reorder program operations. Thus, they deviate from the commonly assumed sequential consistency (SC) semantics. Analysis techniques for concurrent programs consequently need to take reorderings into account. For TSO, this is often accomplished by explicitly modelling store buffers. In this paper, we present an approach for reducing TSO-verification of concurrent… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Handling TSO in Mechanized Linearizability Proofs

Haifa Verification Conference • 2014
View 2 Excerpts

Sagonas . Stateless model checking for TSO and PSO Software verification for weak memory via program transformation

N. S. Arora, R. D. Blumofe, C. G. Plaxton
2013

Similar Papers

Loading similar papers…