The set constraint/CFL reachability connection in practice
In: ACM Sigplan Notices, Jg. 39 (2004-06-01), Heft 6
Online
academicJournal
- 207 - 218
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.
Titel: |
The set constraint/CFL reachability connection in practice
|
---|---|
Autor/in / Beteiligte Person: | Kodumal, John P ; Aiken, A |
Link: | |
Zeitschrift: | ACM Sigplan Notices, Jg. 39 (2004-06-01), Heft 6 |
Veröffentlichung: | eScholarship, University of California, 2004 |
Medientyp: | academicJournal |
Umfang: | 207 - 218 |
Schlagwort: |
|
Sonstiges: |
|