The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Finite Differencing of Computable Expressions
Open accessAbstract
Finite differencing is a program optimization method that generalizes strength reduction, and provides an efficient implementation for a host of program transformations including "iterator inversion."Finite differencing is formally specified in terms of more basic transformations shown to preserve program semantics.Estimates of the speedup that the technique yields are given.A full illustrative example of algorithm derivation is presented.
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
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
Aho, A. V., & Ullman, J. D. (1977) · International Linear Collider · Cited by 1,003
Proceedings of the 27th International Conference on Very Large Data Bases
Apers, P. M. G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., & Snodgrass, R. T. (2001) · Cited by 845
Flow Analysis of Computer Programs
Hecht, M. S. (1977) · Cited by 724
The Computer: From Pascal to von Neumann
Sharlin, H. I., & Goldstine, H. H. (1975) · The American Historical Review · doi:10.2307/1859059 · Cited by 430
Programming languages and their compilers: Preliminary notes
Cocke, J. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 372
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Aho, A. V., & Ullman, J. D. (1977) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 368
A Unified Approach to Path Problems
Tarjan, R. E. (1981) · Journal of the ACM · doi:10.1145/322261.322272 · Cited by 253
Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
Dewar, R., Grand, A., Liu, S.-C., Schwartz, J. T., & Schonberg, E. (1979) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357062.357064 · Cited by 107
Cited by
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
Metadata
- Authors
- Paige, R., & Koenig, S.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1982-07
- Volume
- 4
- Issue
- 3
- Pages
- 402-454
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W1992808564
- Cited by
- 281
- References
- 12
- FWCI
- 14.04
- 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: Finite Differencing of Computable Expressions. https://app.cochat.ai/papers/10.1145/357172.357177
- The paper
- Paige, R., & Koenig, S. (1982). Finite Differencing of Computable Expressions. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/357172.357177
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.
