A Practical and Comparative Study of Call Graph Construction Algorithms
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 1, Issue 4
Abstract
A number of Call Graph construction algorithms have been designed for construction of Call Graphs for object-oriented languages. Each of the Call Graph contraction algorithms were proposed to keep in mind the improvements over previous Call Graphs in terms of precision, cost and accuracy. In object oriented languages the Call Graphs are generally contracted to represent the calling relationship between the program’s methods. The Call Graph forms the bases for deducing the information about the classes and the methods that are actually invoked, this information can be used to find call sites were virtual function calls can be replaced by direct calls and inline-expansions can be put into work where ever possible. In this paper we present an empirical comparison of various well known Call Graph construction algorithms. Here we used Scoot bytecode reader as front-end to implement various Call Graph construction algorisms. In the processes Scoot bytecode reader is used to read the bytecode of a specific java program then the reachable methods are found for each invoked method. For storing information about the classes, methods, fields and statements we created our own set of data structures. Finally we tested and evaluated the developed algorithms with a variety of java benchmark programs to gather the information for the comparison of various Call Graph algorithms which is the goal of this work. We have included most of the Call Graph algorithms of popularity in this work. The main aim of the work is to consider all the dimensions of the Call Graph construction algorithms like cost, precision, memory and time requirements for its construction. The previous works has either not included all the algorithms of fame or have left some of their construction constraints untouched. This work will bring an effective empirical comparison to the front and will help to reveal that which Call Graph construction algorithm is best and when. The results in the work are mainly considered valid for java and other statically typed object-oriented languages.
Authors and Affiliations
Sajad Ahmad Bhat
Keywords
Related Articles
- EP ID EP87486
- DOI -
- Views 141
- Downloads 0
Constrained Engineering DesignOptimization using Average Differential Evolution
The use of metaheuristics has a growing interest in solving constrained optimization problems due to the computational disadvantages of numerical methods. Metaheuristics are a powerful tool in reaching the global optimum...
Analysis of blood samples for counting leukemia cells using Support vector machine and nearest neighbour
Abstract: analysis of blood samples for counting leukemia cells is discussed in this paper. support vector machine and nearest neighbour concept is presented in this paper. The identification of blood disorders,...
Cryptographic Approach of Generic Caching strategy for Opportunistic Wireless Networks (OPPNETS)
Abstract: In Opportunistic networks, if a mobile finds that the content of its interest is available in other mobiles, it will send a message to request for the content and download it. The term subscriber denotes a node...
Transforming XML into Object-Relational Schema
Abstract: Recently, there is a vast increase in the use of XML for describing and exchanging data. To manipulate efficiently these data, it would be wise to use database systems which represent an appropriate tool to sto...
Efficiency of scrum the most widely adopted method for agile software development
Abstract: In the recent past there has been a revolution in software industries. This is because of the software industries have increasingly been adopting agile practices. Scrum is the most widely adopted agile me...