This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Constructing the Call Graph of a Program
May 1979 (vol. 5 no. 3)
pp. 216-226
B.G. Ryder, 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].
Index Terms:
static program analysis, Call graph, Fortran, PFORT verifier, portability, procedure parameters, procedure references
Citation:
B.G. Ryder, "Constructing the Call Graph of a Program," IEEE Transactions on Software Engineering, vol. 5, no. 3, pp. 216-226, May 1979, doi:10.1109/TSE.1979.234183
Usage of this product signifies your acceptance of the Terms of Use.