Context-bounded analysis of tso systems
Context-bounded analysis of tso systems
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.
Atig, Mohamed Faouzi
8e9668c9-2c07-4a02-8a63-709e4a5322d2
Bouajjani, Ahmed
dbe55df0-44d8-45b0-93ca-75357b43e346
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2014
Atig, Mohamed Faouzi
8e9668c9-2c07-4a02-8a63-709e4a5322d2
Bouajjani, Ahmed
dbe55df0-44d8-45b0-93ca-75357b43e346
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Atig, Mohamed Faouzi, Bouajjani, Ahmed and Parlato, Gennaro
(2014)
Context-bounded analysis of tso systems
(Lecture Notes in Computer Science, 8415),
vol. 8415,
Springer
Abstract
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.
More information
Published date: 2014
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 365362
URI: http://eprints.soton.ac.uk/id/eprint/365362
PURE UUID: ba681e34-be58-4398-8c20-d453d63fa399
Catalogue record
Date deposited: 03 Jun 2014 08:36
Last modified: 14 Mar 2024 16:51
Export record
Contributors
Author:
Mohamed Faouzi Atig
Author:
Ahmed Bouajjani
Author:
Gennaro Parlato
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics