• DocumentCode
    1438239
  • Title

    Constructing the procedure call multigraph

  • Author

    Callahan, David ; Carle, Alan ; Hall, Mary Wolcott ; Kennedy, Ken

  • Author_Institution
    Dept. of Comput. Sci., Rice Univ., Houston, TX, USA
  • Volume
    16
  • Issue
    4
  • fYear
    1990
  • fDate
    4/1/1990 12:00:00 AM
  • Firstpage
    483
  • Lastpage
    487
  • Abstract
    An algorithm for constructing a precise call multigraph for languages that permit procedure parameters, extending the method of B. Ryder (see ibid., vol.5, no.3, p.216-225 (1979)) 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
  • Keywords
    parallel programming; algorithm; polynomial; precise call multigraph; procedure call multigraph; recursion; upper bound; Concurrency control; Databases; Delay; Erbium; Etching; Flow graphs; Information retrieval; Notice of Violation; Throughput; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/32.54302
  • Filename
    54302
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1438239