Abstract
We consider parameterized verification of concurrent programs under the Total Store Order (TSO) semantics. A program consists of a set of processes that share a set of variables on which they can perform read and write operations. We show that the reachability problem for a system consisting of an arbitrary number of identical processes is PSPACE-complete. We prove that the complexity is reduced to polynomial time if the processes are not allowed to read the initial values of the variables in the memory. When the processes are allowed to perform atomic read-modify-write operations, the reachability problem has a non-primitive recursive complexity.
Highlights
A parameterized system consists of an arbitrary number of identical concurrent processes
We study parameterized verification of programs running on weak memory models
We describe the concrete operational semantics of programs under Total Store Order (TSO) as a labeled transition system that is induced by a process definition
Summary
A parameterized system consists of an arbitrary number of identical concurrent processes. We consider the decidability and complexity of parameterized verification, where an unbounded number of finite-state processes run concurrently under the Total Store Order (TSO) semantics. We explain why adding read-modify-write operations will make the model retrieve the non-primitive recursive complexity of the reachability problem This is straightforward since the proof for the non-parameterized case involves only two processes [Atig et al 2010].
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
