检索结果-内蒙古大学图书馆

call graph prefetching for database applications

ACM TRANSACTIONS ON COMPUTER SYSTEMS 2003年第4期21卷 412-444页

作者： Annavaram, M Patel, JM Davidson, ES Intel Corp Santa Clara CA 95052 USA Univ Michigan Ann Arbor MI 48109 USA

With the continuing technological trend of ever cheaper and larger memory, most data sets in database servers will soon be able to reside in main memory. In this configuration, the performance bottleneck is likely to be the gap between the processing speed of the CPU and the memory access latency. Previous work has shown that database applications have large instruction and data footprints and hence do not use processor caches effectively. In this paper, we propose call graph Prefetching (CGP), an N instruction prefetching technique that analyzes the call graph of a database system and prefetches instructions from the function that is deemed likely to be called next. CGP capitalizes on the highly predictable function call sequences that are typical of database systems. CGP can be implemented either in software or in hardware. The software-based CGP ( CGP S) uses profile information to build a call graph, and uses the predictable call sequences in the call graph to determine which function to prefetch next. The hardware- based CGP( CGP H) uses a hardware table, called the call graph History Cache (CGHC), to dynamically store sequences of functions invoked during program execution, and uses that stored history when choosing which functions to prefetch. We evaluate the performance of CGP on sets of Wisconsin and TPC-H queries, as well as on CPU-2000 benchmarks. For most CPU-2000 applications the number of instruction cache (I-cache) misses were very few even without any prefetching, obviating the need for CGP. On the other hand, the database workloads do suffer a significant number of I-cache misses;CGP S improves their performance by 23% and CGP H by 26% over a baseline system that has already been highly tuned for efficient I-cache usage by using the OM tool. CGP, with or without OM, reduces the I-cache miss stall time by about 50% relative to O5+OM, taking us about half way from an already highly tuned baseline system toward perfect I-cache performance.

关键词： performance design experimentation instruction cache prefetching call graph database

来源：评论

学校读者我要写书评

暂无评论

Combining concept lattice with call graph for impact analysis

引用

ADVANCES IN ENGINEERING SOFTWARE 2012年 53卷 1-13页

作者： Li, Bixin Sun, Xiaobing Leung, Hareton Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100864 Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

Software change impact analysis (CIA) is a key technique to identify unexpected and potential effects caused by software changes. Given a changed entity, most of current CIA techniques compute the change effect composed of some potentially impacted entities. The generated results are often of no help to the maintainers in starting the analysis of impacted entities. In this article, we combine concept lattice with call graph together to obtain a ranked list of potentially impacted methods from the proposed changed methods and/or classes. These impacted methods are ranked based on the hierarchical feature of concept lattice, represented by an impact factor, which can then be used to prioritize these methods to be inspected. Case studies based on four real-world programs show that our approach can improve the precision of the impact result without severely decreasing its recall, when compared with results from either concept lattice or call graph used independently. In addition, the predicted impacted methods with higher impact factor values are also shown to have higher probability to be affected by the changes. Our study also shows that our approach is better than the JRipples CIA approach in removing the false-positives, but at the cost of losing more false-negatives and much more time overhead. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Formal concept analysis Change impact analysis call graph Impact factor Hierarchical impact results Case study

来源：评论

学校读者我要写书评

暂无评论

Static call graph Combination to Simulate Dynamic call graph Behavior

引用

IEEE ACCESS 2022年 10卷 131829-131840页

作者： Sagodi, Zoltan Pengo, Edit Jasz, Judit Siket, Istvan Ferenc, Rudolf Univ Szeged Dept Software Engn H-6720 Szeged Hungary

call graphs are fundamental for many higher-level code analyses. The selection of the most appropriate call graph construction tool for an analysis is not always straightforward and depends on the purpose of the results' further usage. The choice of call graph construction tool has a great effect on the following tasks' execution time, memory usage, and result quality. This research compares the resulting static and dynamic Java call graphs to assist in the selection of the most appropriate tools. Static call graphs, as their name suggests, are constructed by static analysis, based on the source code or the bytecode, without executing tests or any code parts. This means that the project can be analyzed in its early stages and with fewer resources, but there is concern that this will result in less accurate, noisier graphs since the dynamic behavior of the programs will be estimated by static algorithms. Inaccuracies can greatly affect analyses based on call graphs. On the other hand, dynamic call graphs are created during the actual execution of the program. The calls that are included as edges in the graph are exactly those that were executed during the run, so you can expect the result to be more accurate. However, dynamic analysis requires more resources and the execution of code via test cases which provide high test coverage. In this work, we investigated the relationship between dynamic and static call graphs. Is the graph generated by dynamic analysis really better? Can static graphs approximate or even complement dynamic call graphs with sound results? In order to find the answers to these questions, we compared the results of five static and one dynamic analyzer. They were evaluated on three projects of different sizes and test coverage. We included in the comparison a merged graph created by ourselves by combining different static analyzer outputs. Not only did we compare static graphs to the dynamic results, we also validated the calls in a dynamic graph

关键词： call graph dynamic analysis java static analysis

来源：评论

学校读者我要写书评

暂无评论

Is JavaScript call graph Extraction Solved Yet? A Comparative Study of Static and Dynamic Tools

引用

IEEE ACCESS 2023年 11卷 25266-25284页

作者： Antal, Gabor Hegedus, Peter Herczeg, Zoltan Loki, Gabor Ferenc, Rudolf Univ Szeged Dept Software Engn H-6720 Szeged Hungary

Code analysis is more important than ever because JavaScript is increasingly popular and actively used, both on the client and server sides. Most algorithms for analyzing vulnerabilities, finding coding issues, or inferring type depend on the call graph representation of the underlying program. Luckily, there are quite a few tools to get this job done already. However, their performance in vitro and especially in vivo has not yet been extensively compared and evaluated. In this paper, we compare several approaches for building JavaScript call graphs, namely five static and two dynamic approaches on 26 WebKit SunSpider programs, and two static and two dynamic approaches on 12 real-world *** programs. The tools under examination using static techniques were npm call graph, IBM WALA, Google Closure Compiler, Approximate call graph, and Type Analyzer for JavaScript. We performed dynamic analyzes relying on the nodejs-cg tool (a customized *** runtime) and the NodeProf instrumentation and profiling framework. We provide a quantitative evaluation of the results, and a result quality analysis based on 941 manually validated call edges. On the SunSpider programs, which do not take any inputs, so dynamic extraction could be complete, all the static tools also performed well. For example, TAJS found 93% of all edges while having a 97% precision compared to the precise dynamic call graph. When it comes to real-world *** modules, our evaluation shows that static tools struggle with parsing the code and fail to detect a significant amount of call edges that dynamic approaches can capture. Nonetheless, a significant number of edges not detected by dynamic approaches are also reported. Among these, however, there are also edges that are real, but for some reason the unit tests did not execute the branches in which these calls were included.

关键词： Image edge detection Codes Performance analysis Source coding Static analysis Servers call graph comparative study dynamic code analysis JavaScript static code analysis

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTING THE call graph OF A PROGRAM

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1979年第3期5卷 216-226页

作者： RYDER, BG Department of Computer Science Rutgers University

The proliferation of large software systems written in high level programming languages insures the utility of analysis programs which examine interprocedural communications. Often these analysis programs need to reduce the dynamic relations between procedures to a static data representation. This paper presents one such representation, a directed, acyclic graph named the call graph of a program. We delineate the programs representable by an acyclic call graph and present an algorithm for constructing it using the property that its nodes may be linearly ordered. We prove the correctness of the algorithm and discuss the results obtained from an implementation of the algorithm in the PFORT Verifier [1].

关键词： Static Program Analysis call graph Fortran PFORT Verifier Portability Procedure Parameters Procedure References

来源：评论

学校读者我要写书评

暂无评论

Empirical Study of Python call graph 34

Empirical Study of Python Call Graph

引用

34th IEEE/ACM International Conference on Automated Software Engineering (ASE)

作者： Li, Yu Nanjing Univ Nanjing Peoples R China

ISBN: (纸本)9781728125084

In recent years, the extensive application of the Python language has made its analysis work more and more valuable. Many static analysis algorithms need to rely on the construction of call graphs. In this paper, we did a comparative empirical analysis of several widely used Python static call graph tools both quantitatively and qualitatively. Experiments show that the existing Python static call graph tools have a large difference in the construction effectiveness, and there is still room for improvement.

关键词： Python call graph empirical study quantitative qualitative

来源：评论

学校读者我要写书评

暂无评论

Cross-Language call graph Construction Supporting Different Host Languages 30

Cross-Language Call Graph Construction Supporting Different ...

引用

30th IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Hu, Mingzhe Zhao, Qi Zhang, Yu Xiong, Yan Univ Sci & Technol China Hefei Peoples R China

ISBN: (纸本)9781665452786

Modern software systems are increasingly multilingual, which consist of components developed in different programming languages to reuse existing libraries and combine language features. Foreign function interface (FFI) is a mechanism that enables interoperation between a host language and a guest language. CFFI interoperating with external C is part of the language standard for almost all languages. For example, Python/C API is the CFFI between Python and C/C++. Python host with C guest can achieve both productivity and performance, and is widely used by many mainstream software systems in different application domains. The popularity of these software systems makes high demands on program analysis of multilingual codebases. A fundamental challenge is to construct call graphs that capture the connectivity between host and guest languages. In this work, we present a novel approach to call graph construction for calls from different host languages to C/C++ foreign functions. The semantics of the foreign function declaration interfaces are modeled to establish cross-language call relationships, taking into account the semantic abstraction to support different host languages. graph transformation and function node fusions are defined to build the complete call graphs. We demonstrate experimentally that static call graphs for Python and JavaScript calling C/C++ can be constructed effectively and automatically. The call graph construction can further efficiently work as an IDE language server and integrate with other tools.

关键词： foreign function interface static analysis call graph

来源：评论

学校读者我要写书评

暂无评论

Evaluation and Comparison of Dynamic call graph Generators for JavaScript 14

Evaluation and Comparison of Dynamic Call Graph Generators f...

引用

14th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)

作者： Herczeg, Zoltan Loki, Gabor Univ Szeged Dept Software Engn Dugon Ter 13 H-6720 Szeged Hungary

ISBN: (纸本)9789897583759

JavaScript is the most popular programming language these days and it is also the core language of the *** environment. Sharing code is a simple task in this environment and the shared code can be easily reused as building blocks to create new applications. This vibrant and ever growing environment is not perfect though. Due to the large amount of reused code, even simple applications can have a lot of indirect dependencies. Developers may not even be aware of the fact that some of these dependencies could contain malware, since harmful code can be hidden relatively easily due to the dynamic nature of JavaScript. Dynamic software analysis is one way of detecting suspicious activities. call graphs can reveal the internal workings of an application and they have been used successfully for malware detection. In ***, no tool has been available for directly generating JavaScript call graphs before. In this paper, we are going to introduce three tools that can be used to generate call graphs for further analysis. We show that call graphs contain a significant amount of engine-specific information but filters can be used to reduce such differences.

关键词： JavaScript call graph Node.js Comparison Security Complexity

来源：评论

学校读者我要写书评

暂无评论

Automatic construction of accurate application call graph with library call abstraction for Java

Automatic construction of accurate application call graph wi...

引用

6th IEEE International Workshop on Source Code Analysis and Manipulation

作者： Zhang, Weilei Ryder, Barbara G. Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA

call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software engineering applications, such as program understanding and testing, especially when the library is very big and the calling relationships are not trivial. This paper explores approaches for generating more accurate application call graphs for Java. A new data reachability algorithm is proposed and fine tuned to resolve library callbacks accurately. Compared with an algorithm that resolves library callbacks by traversing the whole-program call graph, the fine-tuned data reachability algorithm results in fewer spurious callback edges. In empirical studies, the new algorithm shows a significant reduction in the number of spurious callback edges. On the basis of the new algorithm, a library abstraction can be calculated automatically and applied in amortized slicing and dataflow testing. Copyright (C) 2007 John Wiley & Sons, Ltd.

关键词： call graph library callback Java analysis

来源：评论

学校读者我要写书评

暂无评论

Incremental call graph Construction in Industrial Practice 23

Incremental Call Graph Construction in Industrial Practice

引用

IEEE/ACM 45th International Conference on Software Engineering - Software Engineering in Practice (ICSE-SEIP)

作者： Zhao, Zelin Wang, Xizao Xu, Zhaogui Tang, Zhenhao Li, Yongchao Di, Peng Ant Grp Hangzhou Peoples R China Nanjing Univ Nanjing Peoples R China

ISBN: (纸本)9798350300376

Interprocedural program analysis is critical in finding hidden program defects and vulnerabilities in CI/CD pipelines. A pre-constructed call graph is a prerequisite for interprocedural analysis. However, the exhaustive call graph construction, i.e., analyzing the target program as a whole and constructing from scratch, often takes too much time. We made a scalable empirical study on both industrial and open-source projects and observed that most program updates only involve a very limited part of the code. The observation inspires an efficient approach that not wholely re-constructs a call graph but incrementally patches the old one with the partial graph affected by the update. We propose a sound incremental call graph construction algorithm that works in a reset-recompute way: first, prune invalid nodes and edges from the old call graph, then analyze the new code to patch it to construct the new one. We implemented the algorithm and built a benchmark suite consisting of 20 industrial and 10 open-source projects. The experimental evaluation shows that the efficiency improvement is encouraging. Compared with the exhaustive construction algorithm, the incremental way can speed up the construction by 20.0 times and reduce the memory and storage consumption to 58.1% and 10.4%, respectively.

关键词： call graph incremental construction class hierarchy analysis CI/CD

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：