11 citations · 37 across the 16 of their papers we have counts for
1 paper · 1 filter
Paraschos Koutris, Shaleen Deep
Many problems in static program analysis can be modeled as the context-free language (CFL) reachability problem on directed labeled graphs. The CFL reachability problem can be gene…