Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
- 5 January 2000
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An Automata-Theoretic Approach to Interprocedural Data-Flow AnalysisPublished by Springer Nature ,1999
- Program analysis via graph reachabilityInformation and Software Technology, 1998
- Interconvertbility of set constraints and context-free language reachabilityPublished by Association for Computing Machinery (ACM) ,1997
- Model checking the full modal mu-calculus for infinite sequential processesPublished by Springer Nature ,1997
- Reachability analysis of pushdown automata: Application to model-checkingPublished by Springer Nature ,1997
- Parallelism for free: Bitvector analyses ⇒ no state explosion!Published by Springer Nature ,1995
- Automatic recognition of tractability in inference relationsJournal of the ACM, 1993
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984