On the verification problem for weak memory models

Atig, Mohamed Faouzi; Bouajjani, Ahmed; Burckhardt, Sebastian; Musuvathi, Madanlal

doi:10.1145/1706299.1706303

Cited by 94 publications

(104 citation statements)

References 20 publications

Supporting

Mentioning

103

Contrasting

Order By: Relevance

“…This corresponds to the use of FIFO buffers where write operations to shared variables can be stored and executed in a delayed way, allowing read operations from the main memory (but on different variables) to overtake them. We define hereafter an operational semantics corresponding to this memory model, in the spirit of the formal model defined in [1]. A store buffer is associated with each thread.…”

Section: Tso Semanticsmentioning

confidence: 99%

“…So, when the point p is reached, the content of the main memory is precisely shared 0 . During the simulation of ρ 0 1 , two operations are performed by P : (1) …”

Section: Simulating Store Buffers: Casementioning

confidence: 99%

“…This leads to the adoption of formal models (based on state machines with queues) for which the decidability of problems such as checking state reachability is not straightforward. It has been shown in [1] that the state reachability problem for TSO is actually decidable (for finite-data programs), but highly complex (nonprimitive recursive). This leaves open the problem of defining efficient verification techniques for TSO.…”

Section: Introductionmentioning

confidence: 99%

“…So far, it has been considered only for the SC memory model. As far as we know, the only works addressing the verification problem for TSO programs with unbounded store buffers are [1,13]. In [1], the decidability and the complexity of the state reachability problem under TSO (and other memory models) is considered for a finite number of finite-state threads.…”

Section: Introductionmentioning

confidence: 99%

“…As far as we know, the only works addressing the verification problem for TSO programs with unbounded store buffers are [1,13]. In [1], the decidability and the complexity of the state reachability problem under TSO (and other memory models) is considered for a finite number of finite-state threads. The decision procedure for TSO given in that paper is based on a reduction to the reachability problem in lossy channel systems, through a nontrivial and complex encoding.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Getting Rid of Store-Buffers in TSO Analysis

Atig

Bouajjani

Parlato

2011

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Abstract. We propose an approach for reducing the TSO reachability analysis of concurrent programs to their SC reachability analysis, under some conditions on the explored behaviors. First, we propose a linear code-to-code translation that takes as input a concurrent program P and produces a concurrent program P such that, running P under SC yields the same set of reachable (shared) states as running P under TSO with at most k context-switches for each thread, for a fixed k. Basically, we show that it is possible to use only O(k) additional copies of the shared variables of P as local variables to simulate the store buffers, even if they are unbounded. Furthermore, we show that our translation can be extended so that an unbounded number of context-switches is possible, under the condition that each write operation sent to the store buffer stays there for at most k contextswitches of the thread. Experimental results show that bugs due to TSO can be detected with small bounds, using off-the-shelf SC analysis tools.

show abstract

Section: Tso Semanticsmentioning

confidence: 99%

“…So, when the point p is reached, the content of the main memory is precisely shared 0 . During the simulation of ρ 0 1 , two operations are performed by P : (1) …”

Section: Simulating Store Buffers: Casementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%