Calling-to-reference context translation via constraint-guided CFL-reachability

Author:

Cai Cheng1,Zhang Qirun2,Zuo Zhiqiang3,Nguyen Khanh1,Xu Guoqing1,Su Zhendong2

Affiliation:

1. University of California at Irvine, USA

2. University of California at Davis, USA

3. Nanjing University, China

Abstract

A calling context is an important piece of information used widely to help developers understand program executions (e.g., for debugging). While calling contexts offer useful control information, information regarding data involved in a bug (e.g., what data structure holds a leaking object), in many cases, can bring developers closer to the bug's root cause. Such data information, often exhibited as heap reference paths, has already been needed by many tools. The only way for a dynamic analysis to record complete reference paths is to perform heap dumping, which incurs huge runtime overhead and renders the analysis impractical. This paper presents a novel static analysis that can precisely infer, from a calling context of a method that contains a use (e.g., read or write) of an object, the heap reference paths leading to the object at the time the use occurs. Since calling context recording is much less expensive, our technique provides benefits for all dynamic techniques that need heap information, significantly reducing their overhead.

Funder

National Science Foundation

Office of Naval Research

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Reference54 articles.

1. GC assertions

2. Rajeev Alur. 2007. Marrying Words and Trees. In PODS. 233–242. 10.1145/1265530.1265564 Rajeev Alur. 2007. Marrying Words and Trees. In PODS. 233–242. 10.1145/1265530.1265564

3. Analysis of recursive state machines

4. Rajeev Alur and P. Madhusudan. 2004. Visibly Pushdown Languages. In STOC. 202–211. 10.1145/1007352.1007390 Rajeev Alur and P. Madhusudan. 2004. Visibly Pushdown Languages. In STOC. 202–211. 10.1145/1007352.1007390

5. Osbert Bastani Saswat Anand and Alex Aiken. 2015. Specification Inference Using CFL Reachability. In POPL. 553–566. 10.1145/2676726.2676977 Osbert Bastani Saswat Anand and Alex Aiken. 2015. Specification Inference Using CFL Reachability. In POPL. 553–566. 10.1145/2676726.2676977

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Eagle;ACM Transactions on Software Engineering and Methodology;2021-10-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3