The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Mechanical program analysis
Open accessAbstract
One means of analyzing program performance is by deriving closed-form expressions for their execution behavior. This paper discusses the mechanization of such analysis, and describes a system, Metric, which is able to analyze simple Lisp programs and produce, for example, closed-form expressions for their running time expressed in terms of size of input. This paper presents the reasons for mechanizing program analysis, describes the operation of Metric, explains its implementation, and discusses its limitations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
An Introduction to Combinatorial Analysis
Leibler, R. A., & Riordan, J. (1958) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002374 · Cited by 1,486
Recursive functions of symbolic expressions and their computation by machine, Part I
McCarthy, J. (1960) · Communications of the ACM · doi:10.1145/367177.367199 · Cited by 1,387
An empirical study of FORTRAN programs
Knuth, D. E. (1971) · Software: Practice and Experience · doi:10.1002/spe.4380010203 · Cited by 680
Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)
McCarthy, J. (2021) · Ideas That Created the Future · doi:10.7551/mitpress/12274.003.0023 · Cited by 532
An Introduction to Combinatorial Analysis
Riordan, J., & Teichmann, T. (1959) · Physics Today · doi:10.1063/1.3060724 · Cited by 495
Green, C. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50019-2 · Cited by 456
Programming languages and their compilers: Preliminary notes
Cocke, J. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 372
Toward automatic program synthesis
Manna, Z., & Waldinger, R. J. (1971) · Communications of the ACM · doi:10.1145/362566.362568 · Cited by 285
Moses, J. C. (1971) · Communications of the ACM · doi:10.1145/362637.362648 · Cited by 139
Cited by
On the Automated Generation of Program Test Data
Ramamoorthy, C. V., Ho, S.-B. F., & Chen, W. T. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233835 · Cited by 319
Proving and applying program transformations expressed with second-order patterns
Huet, G., & Lang, B. (1978) · Acta Informatica · doi:10.1007/bf00264598 · Cited by 283
Metadata
- Authors
- Wegbreit, B.
- Venue
- Communications of the ACM
- Published
- 1975-09
- Volume
- 18
- Issue
- 9
- Pages
- 528-539
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2003295303
- Cited by
- 293
- References
- 12
- FWCI
- 9.48
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Mechanical program analysis. https://app.cochat.ai/papers/10.1145/361002.361016
- The paper
- Wegbreit, B. (1975). Mechanical program analysis. Communications of the ACM. https://doi.org/10.1145/361002.361016
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.