Context-bounded analysis of tso systems

Atig, Mohamed Faouzi, Bouajjani, Ahmed and Parlato, Gennaro (2014) Context-bounded analysis of tso systems, vol. 8415, Springer (Lecture Notes in Computer Science, 8415).


[img] PDF WMM.pdf - Other
Download (313kB)


We address the state reachability problem in concurrent programs running over the TSO weak memory model. This problem has been shown to be decidable with non-primitive recursive complexity in the case of finite-state threads. For recursive threads this problem is undecidable. The aim of this paper is to provide under-approximate analyses for TSO systems that are decidable and have better (elementary) complexity. We propose three bounding concepts for TSO behaviors that are inspired from the concept of bounding the number of context switches introduced by Qadeer and Rehof for the sequentially consistent (SC) model. We investigate the decidability and the complexity of the state reachability problems under these three bounding concepts for TSO, and provide reduction of these problems to known reachability problems of concurrent systems under the SC semantics.

Item Type: Book
Organisations: Electronics & Computer Science
ePrint ID: 365362
Date :
Date Event
Date Deposited: 03 Jun 2014 08:36
Last Modified: 17 Apr 2017 13:43
Further Information:Google Scholar

Actions (login required)

View Item View Item