Persistent Pointer Information

Pointer information, indispensable for static analysis tools, is expensive to compute and query. We provide a query-efficient persistence technique, Pestrie, to mitigate the costly computation and slow querying of precise pointer information. Leveraging equivalence and hub properties, Pestrie can compress pointer information and answers pointer related queries very efficiently. The experiment shows that Pestrie produces 10.5x and 17.5x smaller persistent files than the traditional bitmap and BDD encodings. Meanwhile, Pestrie is 2.9x to 123.6x faster than traditional demand-driven approaches for serving points-to related queries.