1997
DOI: 10.1145/263700.264352
|View full text |Cite
|
Sign up to set email alerts
|

Call graph construction in object-oriented languages

Abstract: Interprocedural analyses enable optimizing compilers to more precisely model the effects of non-inlined procedure calls, pot+ially resulting in substantial increases in application performance. Applying interprocedura! analysis to programs written in object-oriented or functional languages is complicated by the difficulty of constructing an accurate program call graph. This paper presents a parameterized algorithmic framework for call graph cohstruction in the presence'of message sends and/or firstclass functi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
26
0

Year Published

2000
2000
2018
2018

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 63 publications
(27 citation statements)
references
References 29 publications
1
26
0
Order By: Relevance
“…6 indicates that the execution of plug-in A needs to call plug-ins F and G, and the execution of plug-in G needs to call plug-in G. On the other hand, the execution of plug-in D calls plug-ins H and I, and the execution of plug-in H calls G. To illustrate the plug-in calling relation in a vivid manner, we propose to use plug-in calling graph which is motivated by the idea of call graph [30] in the programming area. More specifically, a plug-in calling graph is a directed graph that represents calling relationships between plug-ins.…”
Section: Plug-in Calling Behavior Discoverymentioning
confidence: 99%
“…6 indicates that the execution of plug-in A needs to call plug-ins F and G, and the execution of plug-in G needs to call plug-in G. On the other hand, the execution of plug-in D calls plug-ins H and I, and the execution of plug-in H calls G. To illustrate the plug-in calling relation in a vivid manner, we propose to use plug-in calling graph which is motivated by the idea of call graph [30] in the programming area. More specifically, a plug-in calling graph is a directed graph that represents calling relationships between plug-ins.…”
Section: Plug-in Calling Behavior Discoverymentioning
confidence: 99%
“…In activity generate test case call graphs, a dynamic call graph is generated for each test case in the suite, recovering its hierarchy of method calls.…”
Section: The Refactoring‐based Approachmentioning
confidence: 99%
“…Shivers' work uses a call graph as the internal representation of choice during static analysis. The call graph of a program is a directed graph that represents the relationships between the program's procedures or methods [6]. According to the method being analysed in the call graph, the calling relationships between that method and the methods that call it can span over several depths.…”
Section: Static Analysismentioning
confidence: 99%