Issue No. 04 - April (1990 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.54302
<p>An algorithm for constructing a precise call multigraph for languages that permit procedure parameters, extending the method of B. Ryder for handling recursion, is presented. If it is assumed that there is a constant upper bound on the number of procedure parameters to any procedure in the program, then the algorithm is polynomial in the total number of procedures in the program.</p>
procedure call multigraph; algorithm; precise call multigraph; recursion; upper bound; polynomial; parallel programming.
K. Kennedy, D. Callahan, A. Carle and M. Hall, "Constructing the Procedure Call Multigraph," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 483-487, 1990.