@inproceedings{343d0e0d843a44689571b809b6c50c07,
title = "Decidable Verification under Localized Release-Acquire Concurrency",
abstract = "State reachability for finite state concurrent programs running under Release-Acquire (RA) semantics is known to be undecidable, while under a weaker variant, called Weak-Release-Acquire (WRA), the problem is decidable. However, WRA allows many counterintuitive behaviors not allowed under RA, in which threads locally oscillate between observed values. We propose a strengthening of WRA in the form of a new memory model, which we call Localized Release-Acquire (LRA), that prunes these oscillatory behaviors. We provide semantics for LRA and show that verification under LRA is decidable by extending the potential-based technique used to prove decidability under WRA. The LRA model is still weaker than RA, and thus our results can be used to soundly verify programs under RA.",
keywords = "Relaxed Memory Concurrency, Release-Acquire Semantics, State Reachability",
author = "Singh, {Abhishek Kr} and Ori Lahav",
note = "Publisher Copyright: {\textcopyright} The Author(s) 2024.; 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2024, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024 ; Conference date: 06-04-2024 Through 11-04-2024",
year = "2024",
doi = "10.1007/978-3-031-57256-2_12",
language = "الإنجليزيّة",
isbn = "9783031572555",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "235--254",
editor = "Bernd Finkbeiner and Laura Kov{\'a}cs",
booktitle = "Tools and Algorithms for the Construction and Analysis of Systems - 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Proceedings",
address = "ألمانيا",
}