|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
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 |
| 2 | Guoqing (Harry) Xu, Atanas Rountev |
Detecting inefficiently-used containers to avoid bloat.  |
PLDI  |
2010 |
DBLP DOI BibTeX RDF |
cfl reachability, container bloat, points-to analysis |
| 2 | Vineet Kahlon |
Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks.  |
LICS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Guoqing (Harry) Xu, Atanas Rountev, Manu Sridharan |
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis.  |
ECOOP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Hao Yuan, Patrick Th. Eugster |
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees.  |
ESOP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Xin Zheng, Radu Rugina |
Demand-driven alias analysis for C.  |
POPL  |
2008 |
DBLP DOI BibTeX RDF |
CFL reachability, pointer analysis, alias analysis, memory disambiguation, demand-driven analysis |
| 2 | Polyvios Pratikakis, Jeffrey S. Foster, Michael Hicks |
Existential Label Flow Inference Via CFL Reachability.  |
SAS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | John Kodumal, Alexander Aiken |
The set constraint/CFL reachability connection in practice.  |
PLDI  |
2004 |
DBLP DOI BibTeX RDF |
flow analysis, type qualifiers, set constraints, context-free language reachability |
| 2 | Jakob Rehof, Manuel Fähndrich |
Type-base flow analysis: from polymorphic subtyping to CFL-reachability.  |
POPL  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Swarat Chaudhuri |
Subcubic algorithms for recursive state machines.  |
POPL  |
2008 |
DBLP DOI BibTeX RDF |
CFL-reachability, cubic bottleneck, recursive state machines, transitive closure, interprocedural analysis, context-free languages, pushdown systems |
| 1 | Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav Bodík |
Demand-driven points-to analysis for Java.  |
OOPSLA  |
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: )
|
|