The DOI matches its Crossref record.
Proof of a program: FIND
Open accessAbstract
A proof is given of the correctness of the algorithm “Find.” First, an informal description is given of the purpose of the program and the method used. A systematic technique is described for constructing the program proof during the process of coding it, in such a way as to prevent the intrusion of logical errors. The proof of termination is treated as a separate exercise. Finally, some conclusions relating to general programming methodology are drawn.
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
On the criteria to be used in decomposing systems into modules
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/361598.361623 · Cited by 4,704
Separation logic: a logic for shared mutable data structures
Reynolds, J. C. (2003) · Proceedings 17th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.2002.1029817 · Cited by 2,156
A technique for software module specification with examples
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/355602.361309 · Cited by 726
Structured Programming with go to Statements
Knuth, D. E. (1974) · ACM Computing Surveys · doi:10.1145/356635.356640 · Cited by 678
Tentative steps toward a development method for interfering programs
Jones, C. B. (1983) · ACM Transactions on Programming Languages and Systems · doi:10.1145/69575.69577 · Cited by 617
SELECT—a formal system for testing and debugging programs by symbolic execution
Boyer, R. S., Elspas, B., & Levitt, K. N. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808445 · Cited by 390
Investigations of the software testing coupling effect
Offutt, A. J. (1992) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/125489.125473 · Cited by 371
Specification techniques for data abstractions
Liskov, B., & Zilles, S. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808426 · Cited by 364
On the Criteria To Be Used in Decomposing Systems into Modules
Parnas, D. L. (2002) · Software Pioneers · doi:10.1007/978-3-642-59412-0_26 · Cited by 306
An experimental comparison of the effectiveness of branch testing and data flow testing
Frankl, P. G., & Weiss, S. N. (1993) · IEEE Transactions on Software Engineering · doi:10.1109/32.238581 · Cited by 295
Cyr, D., & Trevor‐Smith, H. (2004) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20075 · Cited by 273
Metadata
- Authors
- Hoare, C. A. R.
- Venue
- Communications of the ACM
- Published
- 1971-01
- Volume
- 14
- Issue
- 1
- Pages
- 39-45
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2160363852
- Cited by
- 180
- References
- 0
- FWCI
- 16.65
- 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
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.