### 12 papers:

- PLDI-2013-ZhangLYS #algorithm #alias #analysis #performance
- Fast algorithms for Dyck-CFL-reachability with applications to alias analysis (QZ, MRL, HY, ZS), pp. 435–446.
- CC-2013-LuSXX #analysis #incremental #points-to
- An Incremental Points-to Analysis with CFL-Reachability (YL, LS, XX, JX), pp. 61–81.
- ASE-2012-Shang0X #analysis #experience #incremental #performance #points-to #precise #summary
- Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience (LS, YL, JX), pp. 270–273.
- DLT-2011-CernoM #automaton
- Δ-Clearing Restarting Automata and CFL (PC, FM), pp. 153–164.
- ESOP-2009-YuanE #algorithm #performance #problem #reachability
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (HY, PTE), pp. 175–189.
- ECOOP-2009-XuRS #alias #analysis #points-to #scalability #using
- Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis (G(X, AR, MS), pp. 98–122.
- LICS-2009-Kahlon #bound #communication #decidability #thread
- Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks (VK), pp. 27–36.
- SAS-2006-PratikakisFH #reachability
- Existential Label Flow Inference Via CFL Reachability (PP, JSF, MH), pp. 88–106.
- PLDI-2004-KodumalA #constraints #reachability #set
- The set constraint/CFL reachability connection in practice (JK, AA), pp. 207–218.
- POPL-2001-RehofF #analysis #polymorphism #type system
- Type-base flow analysis: from polymorphic subtyping to CFL-reachability (JR, MF), pp. 54–66.
- ICALP-1985-MainBH #infinity
- Applications of an Infinite Squarefree CO-CFL (MGM, WB, DH), pp. 404–412.
- STOC-1979-Cook #polynomial
- Deterministic CFL’s Are Accepted Simultaneously in Polynomial Time and Log Squared Space (SAC), pp. 338–345.