A Static Call Graph Construction Method Based on Simulation Execution

Fan Zhang, Naijie Gu, Junjie Su
{"title":"A Static Call Graph Construction Method Based on Simulation Execution","authors":"Fan Zhang, Naijie Gu, Junjie Su","doi":"10.1109/ICSESS47205.2019.9040837","DOIUrl":null,"url":null,"abstract":"Call graphs have many applications in the field of software engineering. For instance, they are at the foundation of many advanced analysis, such as inter-procedural data-flow analysis, and can help software developers to understand programs. Although many methods have been proposed to statically construct call graphs in C/C++ programs, the call graphs constructed by these methods are still not complete and accurate enough. Especially for the parent-child relationship between threads, there is currently no method that can extract it statically. In order to solve these problems, this paper proposes a static analysis method based on simulation execution to construct call graphs of C/C++ programs. The method analyzes the LLVM IR generated by the source program compilation, and it performs simulation execution on the LLVM IR to generate call graphs. The experimental results show that compared to existing static analysis methods, the proposed method has higher recall rate and higher precision rate, and can analyze the parent-child relationship between threads in a program that uses the pthread library.","PeriodicalId":203944,"journal":{"name":"2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS47205.2019.9040837","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Call graphs have many applications in the field of software engineering. For instance, they are at the foundation of many advanced analysis, such as inter-procedural data-flow analysis, and can help software developers to understand programs. Although many methods have been proposed to statically construct call graphs in C/C++ programs, the call graphs constructed by these methods are still not complete and accurate enough. Especially for the parent-child relationship between threads, there is currently no method that can extract it statically. In order to solve these problems, this paper proposes a static analysis method based on simulation execution to construct call graphs of C/C++ programs. The method analyzes the LLVM IR generated by the source program compilation, and it performs simulation execution on the LLVM IR to generate call graphs. The experimental results show that compared to existing static analysis methods, the proposed method has higher recall rate and higher precision rate, and can analyze the parent-child relationship between threads in a program that uses the pthread library.
一种基于仿真执行的静态调用图构建方法
调用图在软件工程领域有许多应用。例如,它们是许多高级分析的基础,例如过程间数据流分析,并且可以帮助软件开发人员理解程序。尽管在C/ c++程序中提出了许多静态构造调用图的方法,但这些方法构造的调用图仍然不够完整和准确。特别是对于线程之间的父子关系,目前还没有方法可以静态地提取它。为了解决这些问题,本文提出了一种基于仿真执行的静态分析方法来构建C/ c++程序的调用图。该方法对源程序编译生成的LLVM IR进行分析,并在LLVM IR上进行仿真执行,生成调用图。实验结果表明,与现有的静态分析方法相比,该方法具有更高的查全率和更高的准确率,并且能够分析使用pthread库的程序中线程之间的父子关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信