Abstract: Computing biconnected components (BCC) of a graph is a fundamental graph problem. The canonical parallel BCC algorithm is the Tarjan-Vishkin algorithm, which has optimal work (total number of operations) and polylogarithmic span (parallel time). However, Tarjan-Vishkin is not widely used in practice due to space-…

Abstract: Researchers have rightfully been concerned about preventing memory errors, but in doing so have ignored methods to improve the security of the parts of the program that are already memory safe. We propose techniques to perform comprehensive memory safety validation that identify the program objects whose accesses…