Symbol-Specific Sparsification of Interprocedural Distributive Environment Problems

Abstract

Previous work has shown that one can often greatly speed up static analysis by computing data flows not for every edge in the program's control-flow graph but instead only along definition-use chains. This yields a so-called sparse static analysis. Recent work on SparseDroid has shown that specifically taint analysis can be "sparsified" with extraordinary effectiveness because the taint state of one variable does not depend on those of others. This allows one to soundly omit more flow-function computations than in the general case.

BibTeX

@inproceedings{Karakaya-Bodden:ICSE24,
  author    = {Kadiray Karakaya and
               Eric Bodden},
  title     = {{Symbol-Specific} Sparsification of Interprocedural Distributive Environment Problems},
  booktitle = {ICSE},
  pages     = {104:1--104:12},
  publisher = {{ACM}},
  year      = {2024},
}

Symbol-Specific Sparsification of Interprocedural Distributive Environment Problems

Abstract

Related papers