The DOI matches its Crossref record.
Constructing the Call Graph of a Program
Abstract
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].
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Context-sensitive interprocedural points-to analysis in the presence of function pointers
Emami, M., Ghiya, R., & Hendren, L. J. (1994) · Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation · doi:10.1145/178243.178264 · Cited by 570
Communicating While Computing: Distributed mobile cloud computing over 5G heterogeneous networks
Barbarossa, S., Sardellitti, S., & Di Lorenzo, P. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2334709 · Cited by 468
A survey on computation offloading modeling for edge computing
Lin, H., Zeadally, S., Chen, Z., Labiod, H., & Wang, L. (2020) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2020.102781 · Cited by 305
AutoCodeRover: Autonomous Program Improvement
Zhang, Y., Ruan, H., Fan, Z., & Roychoudhury, A. (2024) · Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3650212.3680384 · Cited by 202
AutoCodeRover: Autonomous Program Improvement
Zhang, Y., Ruan, H., Fan, Z., & Roychoudhury, A. (2024) · arXiv · doi:10.48550/arxiv.2404.05427 · Cited by 202
Metadata
- Authors
- Ryder, B. G.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 1979-05
- Volume
- SE-5
- Issue
- 3
- Pages
- 216-226
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W1966831167
- Cited by
- 302
- References
- 0
- FWCI
- 0.49
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Constructing the Call Graph of a Program. https://app.cochat.ai/papers/10.1109/tse.1979.234183
- The paper
- Ryder, B. G. (1979). Constructing the Call Graph of a Program. IEEE Transactions on Software Engineering. https://doi.org/10.1109/tse.1979.234183
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.