1 code implementation • 3 Sep 2021 • Qingkai Shi, Yongchao Wang, Charles Zhang
Many context-sensitive data flow analyses can be formulated as a variant of the all-pairs Dyck-CFL reachability problem, which, in general, is of sub-cubic time complexity and quadratic space complexity.
