Binary code similarity detection, which answers whether two pieces of binary code are
similar, has been used in a number of applications, such as vulnerability detection and …

Detecting strongly connected components (SCCs) in a directed graph is crucial for
understanding the structure of graphs. Most real-world graphs have one large SCC that …

Identifying the compilation provenance of a binary code helps to pinpoint the specific
compilation tools and configurations that were used to produce the executable …

The K shortest path (KSP) algorithm, which finds the top K shortest simple paths from a
source to a target vertex, has a wide range of real-world applications, eg, routing …

Since the dawn of the Information Age, we have increasingly relied on the technology that
we develop to support nearly every aspect of modern living. At this point in our history, we …

Modern application workloads are mostly deployed on cloud computing platforms. Illicit
communication across user domains is prohibited by Operating System (OS) or Virtual …

Parallel graph processing is central to analytical computer science applications, and GPUs
have proven to be an ideal platform for parallel graph processing. Existing GPU graph …

Graph is a natural representation for many real-world applications, such as road map,
protein-protein interaction network, and code graph. The graph algorithms can help mine …