|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 14 keywords
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
133 | Vineet Kahlon |
Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 27-36, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
127 | Hao Yuan, Patrick Th. Eugster |
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems, 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 175-189, 2009, Springer, 978-3-642-00589-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
120 | Guoqing Xu 0001, Atanas Rountev, Manu Sridharan |
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP 2009 - Object-Oriented Programming, 23rd European Conference, Genoa, Italy, July 6-10, 2009. Proceedings, pp. 98-122, 2009, Springer, 978-3-642-03012-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
100 | John Kodumal, Alexander Aiken |
The set constraint/CFL reachability connection in practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, June 9-11, 2004, pp. 207-218, 2004, ACM, 1-58113-807-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
flow analysis, type qualifiers, set constraints, context-free language reachability |
74 | Jakob Rehof, Manuel Fähndrich |
Type-base flow analysis: from polymorphic subtyping to CFL-reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, London, UK, January 17-19, 2001, pp. 54-66, 2001, ACM, 1-58113-336-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
65 | Guoqing Xu 0001, Atanas Rountev |
Detecting inefficiently-used containers to avoid bloat. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, June 5-10, 2010, pp. 160-173, 2010, ACM, 978-1-4503-0019-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
cfl reachability, container bloat, points-to analysis |
65 | Xin Zheng, Radu Rugina |
Demand-driven alias analysis for C. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pp. 197-208, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
CFL reachability, pointer analysis, alias analysis, memory disambiguation, demand-driven analysis |
57 | Polyvios Pratikakis, Jeffrey S. Foster, Michael Hicks 0001 |
Existential Label Flow Inference Via CFL Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006, Proceedings, pp. 88-106, 2006, Springer, 3-540-37756-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
47 | Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav Bodík |
Demand-driven points-to analysis for Java. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OOPSLA ![In: Proceedings of the 20th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2005, October 16-20, 2005, San Diego, CA, USA, pp. 59-76, 2005, ACM, 1-59593-031-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
refinement, points-to analysis, demand-driven analysis, context-free language reachability |
42 | Swarat Chaudhuri |
Subcubic algorithms for recursive state machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008, pp. 159-169, 2008, ACM, 978-1-59593-689-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
CFL-reachability, cubic bottleneck, recursive state machines, transitive closure, interprocedural analysis, context-free languages, pushdown systems |
34 | Paraschos Koutris, Shaleen Deep |
The Fine-Grained Complexity of CFL Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 7(POPL), pp. 1713-1739, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Aleksandra Istomina, Semyon V. Grigorev, Ekaterina N. Shemetova |
Fine-grained reductions around CFL-reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.15967, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Paraschos Koutris, Shaleen Deep |
The Fine-Grained Complexity of CFL Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.09284, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Wenjie Zhang 0007, Guancheng Wang 0001, Junjie Chen 0003, Yingfei Xiong 0001, Yong Liu, Lu Zhang 0023 |
OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.06771, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Wenjie Zhang 0007, Guancheng Wang 0001, Junjie Chen 0003, Yingfei Xiong 0001, Yong Liu 0030, Lu Zhang 0023 |
OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 38th IEEE/ACM International Conference on Automated Software Engineering, ASE 2023, Luxembourg, September 11-15, 2023, pp. 1200-1211, 2023, IEEE, 979-8-3503-2996-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
34 | Dmitry Chistikov 0001, Rupak Majumdar, Philipp Schepper |
Subcubic certificates for CFL reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 6(POPL), pp. 1-29, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
34 | Qingkai Shi, Yongchao Wang, Peisen Yao, Charles Zhang 0001 |
Indexing the extended Dyck-CFL reachability for context-sensitive program analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 6(OOPSLA2), pp. 1438-1468, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
34 | Dmitry Chistikov 0001, Rupak Majumdar, Philipp Schepper |
Subcubic Certificates for CFL Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.13095, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
34 | Jingbo Lu, Dongjie He, Jingling Xue |
Eagle: CFL-Reachability-Based Precision-Preserving Acceleration of Object-Sensitive Pointer Analysis with Partial Context Sensitivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Softw. Eng. Methodol. ![In: ACM Trans. Softw. Eng. Methodol. 30(4), pp. 46:1-46:46, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
34 | Jingbo Lu, Dongjie He, Jingling Xue |
Selective Context-Sensitivity for k-CFA with CFL-Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis - 28th International Symposium, SAS 2021, Chicago, IL, USA, October 17-19, 2021, Proceedings, pp. 261-285, 2021, Springer, 978-3-030-88805-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
34 | Jingbo Lu |
Precision-Preserving Acceleration of Object-Sensitive Pointer Analysis with CFL-Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
34 | Cheng Cai, Qirun Zhang, Zhiqiang Zuo 0002, Khanh Nguyen 0001, Guoqing Harry Xu, Zhendong Su 0001 |
Calling-to-reference context translation via constraint-guided CFL-reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, June 18-22, 2018, pp. 196-210, 2018, ACM, 978-1-4503-5698-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
34 | Andrei Marian Dan, Manu Sridharan, Satish Chandra 0001, Jean-Baptiste Jeannin, Martin T. Vechev |
Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (2) ![In: Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II, pp. 521-541, 2017, Springer, 978-3-319-63389-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
34 | Hao Tang, Di Wang 0017, Yingfei Xiong 0001, Lingming Zhang 0001, Xiaoyin Wang, Lu Zhang 0023 |
Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, pp. 880-908, 2017, Springer, 978-3-662-54433-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
34 | Ana L. Milanova, Wei Huang 0001, Yao Dong 0001 |
CFL-reachability and context-sensitive integrity types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPPJ ![In: 2014 International Conference on Principles and Practices of Programming on the Java Platform Virtual Machines, Languages and Tools, PPPJ '14, Cracow, Poland, September 23-26, 2014, pp. 99-109, 2014, ACM, 978-1-4503-2926-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
34 | Yu Su 0012, Ding Ye, Jingling Xue |
Parallel Pointer Analysis with CFL-Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 43rd International Conference on Parallel Processing, ICPP 2014, Minneapolis, MN, USA, September 9-12, 2014, pp. 451-460, 2014, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
34 | Yi Lu 0003, Lei Shang 0002, Xinwei Xie, Jingling Xue |
An Incremental Points-to Analysis with CFL-Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction - 22nd International Conference, CC 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, pp. 61-81, 2013, Springer, 978-3-642-37050-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
34 | Qirun Zhang, Michael R. Lyu, Hao Yuan, Zhendong Su 0001 |
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '13, Seattle, WA, USA, June 16-19, 2013, pp. 435-446, 2013, ACM, 978-1-4503-2014-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
34 | Qirun Zhang |
Scaling CFL-reachability-based alias analysis: theory and practice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
34 | Lei Shang 0002, Yi Lu 0003, Jingling Xue |
Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: IEEE/ACM International Conference on Automated Software Engineering, ASE'12, Essen, Germany, September 3-7, 2012, pp. 270-273, 2012, ACM, 978-1-4503-1204-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
34 | Lei Shang 0002 |
Efficient points-to analysis based on CFL-reachability summarisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2012 |
RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|