The Decidability of Verification under PS 2.0

Abstract We consider the reachability problem for finite-state multi-threaded programs under promising semantics () of Lee et al., which captures most common program transformations. Since is already known to be undecidable in fragment with only release-acquire accesses (-), we relaxed and promises (). show that general it becomes decidable, albeit non-primitive recursive, if bound number promises. Given these results, a bounded version problem. To this end, both “ view-switches ”, i.e., times processes may switch their local views global memory. provide code-to-code translation from an input (with memory along promises) SC, thereby reducing context-switching SC. have implemented tool tested on set benchmarks, demonstrating typical bugs can found small bound.