Interconvertbility of set constraints and context-free language reachability
- 1 December 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 32 (12) , 74-89
- https://doi.org/10.1145/258994.259006
Abstract
We show the interconvertibility of context-free-language reachability problems and a class of setconstraintproblems: given a context-free-language reachability problem, we show how to construct aset-constraint problem whose answer gives a solution to the reachability problem; given a set-constraintproblem, we show how to construct a context-free-language reachability problem whose answer gives asolution to the set-constraint problem. The interconvertibility of these two formalisms offers an ...Keywords
This publication has 16 references indexed in Scilit:
- On the complexity of set-based analysisPublished by Association for Computing Machinery (ACM) ,1997
- Linear-time subtransitive control flow analysisPublished by Association for Computing Machinery (ACM) ,1997
- On the sequential nature of interprocedural program-analysis problemsActa Informatica, 1996
- Demand interprocedural dataflow analysisPublished by Association for Computing Machinery (ACM) ,1995
- Precise interprocedural dataflow analysis via graph reachabilityPublished by Association for Computing Machinery (ACM) ,1995
- Speeding up slicingPublished by Association for Computing Machinery (ACM) ,1994
- A generalized theory of bit vector data flow analysisACM Transactions on Programming Languages and Systems, 1994
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990
- Fast interprocedual alias analysisPublished by Association for Computing Machinery (ACM) ,1989
- On Live-Dead Analysis for Global Data Flow ProblemsJournal of the ACM, 1977