Sciweavers

Share
PLDI
2004
ACM

The set constraint/CFL reachability connection in practice

11 years 6 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new reduction from Dyck-CFL reachability to set constraints 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 constraints toolkit and tested its performance on a substantial polymorphic flow analysis application. Categories and Subject Descriptors D.2.4 [Software Engineering]: Software/Program Verification; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages General Terms Algorithms, Design, Experimentation, Languages, Theory Keywords Set constraints, context-free language reachability, flow analysis, type qualifiers
John Kodumal, Alexander Aiken
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where PLDI
Authors John Kodumal, Alexander Aiken
Comments (0)
books