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 promi...