Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Set Constraint/CFL Reachability Connection in John Kodumal
 

Summary: The Set Constraint/CFL Reachability Connection in
Practice
John Kodumal
EECS Department
University of California, Berkeley
jkodumal@cs.berkeley.edu
Alex Aiken
Computer Science Department
Stanford University
aiken@cs.stanford.edu
ABSTRACT
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

  

Source: Aiken, Alex - Department of Computer Science, Stanford University

 

Collections: Computer Technologies and Information Sciences