{"title":"需求驱动的分析点细化","authors":"Chenguang Sun, S. Midkiff","doi":"10.1109/ICSE-Companion.2019.00106","DOIUrl":null,"url":null,"abstract":"We present DynaSens, a demand-driven approach to points-to analysis that uses slicing to automatically adjust the analysis' context-sensitivity. Within a points-to analysis, heap-carried data flows are composed of loads and stores, and these heap-carried dependences are difficult to resolve. Having observed the limitations of existing techniques, we propose a slicing analysis based on a demand-driven approach to resolve such dependences. Given a points-to query, a collection of relevant program elements is identified by the slicing analysis and handled context-sensitively by the points-to analysis. We compare the precision and cost of our points-to analysis against two state-of-the-art uniformly context-sensitive analyses that achieve the best trade between cost and precision to date. Evaluation results shows the points-to analysis refined by the slicing analysis achieves higher precision in most tests than the uniformly context-sensitive analyses, which are many times more costly.","PeriodicalId":273100,"journal":{"name":"2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Demand-Driven Refinement of Points-to Analysis\",\"authors\":\"Chenguang Sun, S. Midkiff\",\"doi\":\"10.1109/ICSE-Companion.2019.00106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present DynaSens, a demand-driven approach to points-to analysis that uses slicing to automatically adjust the analysis' context-sensitivity. Within a points-to analysis, heap-carried data flows are composed of loads and stores, and these heap-carried dependences are difficult to resolve. Having observed the limitations of existing techniques, we propose a slicing analysis based on a demand-driven approach to resolve such dependences. Given a points-to query, a collection of relevant program elements is identified by the slicing analysis and handled context-sensitively by the points-to analysis. We compare the precision and cost of our points-to analysis against two state-of-the-art uniformly context-sensitive analyses that achieve the best trade between cost and precision to date. Evaluation results shows the points-to analysis refined by the slicing analysis achieves higher precision in most tests than the uniformly context-sensitive analyses, which are many times more costly.\",\"PeriodicalId\":273100,\"journal\":{\"name\":\"2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSE-Companion.2019.00106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/ACM 41st International Conference on Software Engineering: Companion Proceedings (ICSE-Companion)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSE-Companion.2019.00106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们提出了DynaSens,这是一种需求驱动的点对分析方法,它使用切片来自动调整分析的上下文敏感性。在点到分析中,堆携带的数据流由负载和存储组成,这些堆携带的依赖关系很难解决。在观察到现有技术的局限性之后,我们提出了一种基于需求驱动方法的切片分析来解决这种依赖性。给定一个点到查询,切片分析将识别相关程序元素的集合,并由点到分析对上下文敏感地进行处理。我们将点到分析的精度和成本与两种最先进的统一上下文敏感分析进行比较,这两种分析在成本和精度之间实现了迄今为止的最佳平衡。评估结果表明,在大多数测试中,通过切片分析改进的点分析比统一的上下文敏感分析获得了更高的精度,而后者的成本要高许多倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Demand-Driven Refinement of Points-to Analysis
We present DynaSens, a demand-driven approach to points-to analysis that uses slicing to automatically adjust the analysis' context-sensitivity. Within a points-to analysis, heap-carried data flows are composed of loads and stores, and these heap-carried dependences are difficult to resolve. Having observed the limitations of existing techniques, we propose a slicing analysis based on a demand-driven approach to resolve such dependences. Given a points-to query, a collection of relevant program elements is identified by the slicing analysis and handled context-sensitively by the points-to analysis. We compare the precision and cost of our points-to analysis against two state-of-the-art uniformly context-sensitive analyses that achieve the best trade between cost and precision to date. Evaluation results shows the points-to analysis refined by the slicing analysis achieves higher precision in most tests than the uniformly context-sensitive analyses, which are many times more costly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the Deterioration of Learning-Based Malware Detectors for Android Quantifying Patterns and Programming Strategies in Block-Based Programming Environments A Data-Driven Security Game to Facilitate Information Security Education Toward Detection and Characterization of Variability Bugs in Configurable C Software: An Empirical Study Mimicking User Behavior to Improve In-House Test Suites
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1