Constructing the Call Graph of a Program

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