Persistent Memory (PMEM) programs present unique programmability challenges. An important challenge involves ensuring that programs with mixed volatile-memory and persistent-memory ensure an important reachability invariant: at no point in the program execution should a persistent memory region contain a pointer to a volatile memory region. Such invariants are difficult to detect through testing methodologies, as the corresponding failures show up only in the presence of crashes. Prior work has leveraged runtime support in managed languages like Java \cite{autopersist} to check these invariants at runtime. However, such proposals incur a significant runtime cost. We propose a compile-time analysis that checks and maintains such reachability invariants statically with high precision. We implement this compile-time analysis in tool called \toolName{} which identifies such reachability-invariant violations and proposes fixes in C/C++ code.

Faculty member in the CS department at IIT Delhi, India. Co-Founder of CompilerAI Labs. Works on program equivalence checking and program superoptimization.