The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Gprof: A call graph execution profiler
Abstract
Large complex programs are composed of many small routines that implement abstractions for the routines that call them. To be useful, an execution profiler must attribute execution time in a way that is significant for the logical structure of a program as well as for its textual decomposition. This data must then be displayed to the user in a convenient and informative way. The gprof profiler accounts for the running time of called routines in the running time of the routines that call them. The design and use of this profiler is described.
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
Cites
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
An empirical study of FORTRAN programs
Knuth, D. E. (1971) · Software: Practice and Experience · doi:10.1002/spe.4380010203 · Cited by 680
Cited by
Continuous profiling: where have all the cycles gone?
Anderson, J. M., Berc, L. M., Dean, J., Ghemawat, S., Henzinger, M. R., Leung, S.-T. A., Sites, R. L., Vandevoorde, M. T., Waldspurger, C. A., & Weihl, W. E. (1997) · ACM Transactions on Computer Systems · doi:10.1145/265924.265925 · Cited by 481
Connecting tools using message passing in the Field environment
Reiss, S. P. (1990) · IEEE Software · doi:10.1109/52.56450 · Cited by 413
Software Black Box: an alternative mechanism for failure analysis
Elbaum, S., & Munson, J. C. (2002) · Proceedings 11th International Symposium on Software Reliability Engineering. ISSRE 2000 · doi:10.1109/issre.2000.885887 · Cited by 15
Call graph profiling for multi agent systems
Doan Van Bien, D., Lillis, D., & Collier, R. W. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13338-1_9 · Cited by 3
Metadata
- Authors
- Graham, S. L., Kessler, P. B., & Mckusick, M. K.
- Venue
- ACM SIGPLAN Notices
- Published
- 1982-06
- Volume
- 17
- Issue
- 6
- Pages
- 120-126
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W4256386389
- Cited by
- 297
- References
- 2
- FWCI
- 0.00
- 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
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.