Summary: The Set Constraint/CFL Reachability Connection in
University of California, Berkeley
Computer Science Department
Many program analyses can be reduced to graph reachabil-
ity problems involving a limited form of context-free lan-
guage reachability called Dyck-CFL reachability. We show
a new reduction from Dyck-CFL reachability to set con-
straints that can be used in practice to solve these problems.
Our reduction is much simpler than the general reduction
from context-free language reachability to set constraints.
We have implemented our reduction on top of a set con-
straints toolkit and tested its performance on a substantial