The C/C++ 2011 ISO standard (C11) supports relaxed memory consistency with additional ordering constraints over concurrent memory accesses. One widely used subset of these memory consistencies is known as the RA memory model. The semantics of the RA memory model, while facilitates compiler optimizations, complicates the reasoning of parallel programs. This talk will be focused on the verification of programs executing under C/C++11 RA memory model using thread-Modular abstract analysis.