The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase cfl reachability (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2001-2010 (10)
Publication types (Num. hits)
inproceedings(10)
Venues (Conferences, Journals, ...)
POPL(3) PLDI(2) ECOOP(1) ESOP(1) LICS(1) OOPSLA(1) SAS(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 17 occurrences of 14 keywords

Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Guoqing (Harry) Xu, Atanas Rountev Detecting inefficiently-used containers to avoid bloat. Search on Bibsonomy PLDI The full citation details ... 2010 DBLP  DOI  BibTeX  RDF cfl reachability, container bloat, points-to analysis
2Vineet Kahlon Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks. Search on Bibsonomy LICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Guoqing (Harry) Xu, Atanas Rountev, Manu Sridharan Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis. Search on Bibsonomy ECOOP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Hao Yuan, Patrick Th. Eugster An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees. Search on Bibsonomy ESOP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Xin Zheng, Radu Rugina Demand-driven alias analysis for C. Search on Bibsonomy POPL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF CFL reachability, pointer analysis, alias analysis, memory disambiguation, demand-driven analysis
2Polyvios Pratikakis, Jeffrey S. Foster, Michael Hicks Existential Label Flow Inference Via CFL Reachability. Search on Bibsonomy SAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2John Kodumal, Alexander Aiken The set constraint/CFL reachability connection in practice. Search on Bibsonomy PLDI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF flow analysis, type qualifiers, set constraints, context-free language reachability
2Jakob Rehof, Manuel Fähndrich Type-base flow analysis: from polymorphic subtyping to CFL-reachability. Search on Bibsonomy POPL The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Swarat Chaudhuri Subcubic algorithms for recursive state machines. Search on Bibsonomy POPL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF CFL-reachability, cubic bottleneck, recursive state machines, transitive closure, interprocedural analysis, context-free languages, pushdown systems
1Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav Bodík Demand-driven points-to analysis for Java. Search on Bibsonomy OOPSLA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF refinement, points-to analysis, demand-driven analysis, context-free language reachability
Displaying result #1 - #10 of 10 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.