Search results for "CFL-reachability"

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.	LICS	2009	DBLP DOI BibTeX RDF
127	Hao Yuan, Patrick Th. Eugster	An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees.	ESOP	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.	ECOOP	2009	DBLP DOI BibTeX RDF
100	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
74	Jakob Rehof, Manuel Fähndrich	Type-base flow analysis: from polymorphic subtyping to CFL-reachability.	POPL	2001	DBLP DOI BibTeX RDF
65	Guoqing Xu 0001, Atanas Rountev	Detecting inefficiently-used containers to avoid bloat.	PLDI	2010	DBLP DOI BibTeX RDF	cfl reachability, container bloat, points-to analysis
65	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
57	Polyvios Pratikakis, Jeffrey S. Foster, Michael Hicks 0001	Existential Label Flow Inference Via CFL Reachability.	SAS	2006	DBLP DOI BibTeX RDF
47	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
42	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
34	Paraschos Koutris, Shaleen Deep	The Fine-Grained Complexity of CFL Reachability.	Proc. ACM Program. Lang.	2023	DBLP DOI BibTeX RDF
34	Aleksandra Istomina, Semyon V. Grigorev, Ekaterina N. Shemetova	Fine-grained reductions around CFL-reachability.	CoRR	2023	DBLP DOI BibTeX RDF
34	Paraschos Koutris, Shaleen Deep	The Fine-Grained Complexity of CFL Reachability.	CoRR	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.	CoRR	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.	ASE	2023	DBLP DOI BibTeX RDF
34	Dmitry Chistikov 0001, Rupak Majumdar, Philipp Schepper	Subcubic certificates for CFL reachability.	Proc. ACM Program. Lang.	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.	Proc. ACM Program. Lang.	2022	DBLP DOI BibTeX RDF
34	Dmitry Chistikov 0001, Rupak Majumdar, Philipp Schepper	Subcubic Certificates for CFL Reachability.	CoRR	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.	ACM Trans. Softw. Eng. Methodol.	2021	DBLP DOI BibTeX RDF
34	Jingbo Lu, Dongjie He, Jingling Xue	Selective Context-Sensitivity for k-CFA with CFL-Reachability.	SAS	2021	DBLP DOI BibTeX RDF
34	Jingbo Lu	Precision-Preserving Acceleration of Object-Sensitive Pointer Analysis with CFL-Reachability.		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.	PLDI	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.	CAV (2)	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.	ESOP	2017	DBLP DOI BibTeX RDF
34	Ana L. Milanova, Wei Huang 0001, Yao Dong 0001	CFL-reachability and context-sensitive integrity types.	PPPJ	2014	DBLP DOI BibTeX RDF
34	Yu Su 0012, Ding Ye, Jingling Xue	Parallel Pointer Analysis with CFL-Reachability.	ICPP	2014	DBLP DOI BibTeX RDF
34	Yi Lu 0003, Lei Shang 0002, Xinwei Xie, Jingling Xue	An Incremental Points-to Analysis with CFL-Reachability.	CC	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.	PLDI	2013	DBLP DOI BibTeX RDF
34	Qirun Zhang	Scaling CFL-reachability-based alias analysis: theory and practice.		2013	RDF
34	Lei Shang 0002, Yi Lu 0003, Jingling Xue	Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience.	ASE	2012	DBLP DOI BibTeX RDF
34	Lei Shang 0002	Efficient points-to analysis based on CFL-reachability summarisation.		2012	RDF