Parameterized Verification under The Total Store Order Memory Modelis EXPTIME-Complete
In this paper, we study the problem of parameterized verification of a concurrent program running under the Total Store Order (TSO) memory model. A concurrent program is a finite set of processes that are instances of the same pushdown system and which communicate through a set of shared variables....
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2021
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-455510 |