The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Social processes and proofs of theorems and programs
Open accessAbstract
It is argued that formal verifications of programs, no matter how obtained, will not play the same key role in the development of computer science and software engineering as proofs do in mathematics. Furthermore the absence of continuity, the inevitability of change, and the complexity of specification of significantly many real programs make the formal verification process difficult to justify and manage. It is felt that ease of formal verification should not dominate program language design.
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
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
Proofs and Refutations: The Logic of Mathematical Discovery
(1976) · Cambridge University Press eBooks · doi:10.1017/cbo9781139171472 · Cited by 2,343
Proofs and Refutations: The Logic of Mathematical Discovery
Lakatos, I., WORRALL, J. L., & Zahar, E. G. (2015) · Medical Entomology and Zoology · Cited by 1,270
The thirteen books of Euclid's Elements
Euclid (1956) · CERN Document Server (European Organization for Nuclear Research) · Cited by 875
A Course in Mathematical Logic
Manin, Y. I. (1977) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-4385-2 · Cited by 545
Hoare, C. A. R. (1961) · Communications of the ACM · doi:10.1145/366622.366647 · Cited by 429
Algorithms and Complexity: New Directions and Recent Results
Traub, J. F. (1976) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 427
Ulam, S. M. (2019) · Mathematics: People · Problems · Results · doi:10.1201/9781351074315-24 · Cited by 397
Chief programmer team management of production programming
Baker, F. T. (1972) · IBM Systems Journal · doi:10.1147/sj.111.0056 · Cited by 325
The complexity of decision problems in automata theory and logic.
Stockmeyer, L. (1974) · Cited by 300
Cited by
Coward, P. D. (1990) · The Software Life Cycle · doi:10.1016/b978-0-408-03741-9.50028-3 · Cited by 1,290
Programs, life cycles, and laws of software evolution
Lehman, M. M. (1980) · Proceedings of the IEEE · doi:10.1109/proc.1980.11805 · Cited by 1,181
Validation, Verification, and Testing of Computer Software
Adrion, W. R., Branstad, M. A., & Cherniavsky, J. C. (1982) · ACM Computing Surveys · doi:10.1145/356876.356879 · Cited by 426
Designing programs that check their work
Blum, M., & Kannan, S. (1995) · Journal of the ACM · doi:10.1145/200836.200880 · Cited by 393
Using formal specifications to support testing
Hierons, R. M., Bogdanov, K., Bowen, J. P., Cleaveland, R., Derrick, J., Dick, J., Gheorghe, M., Harman, M., Kapoor, K., Krause, P., et al. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459354 · Cited by 356
Metadata
- Authors
- De Millo, R. A., Lipton, R. J., & Perlis, A. J.
- Venue
- Communications of the ACM
- Published
- 1979-05
- Volume
- 22
- Issue
- 5
- Pages
- 271-280
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2005973420
- Cited by
- 537
- References
- 14
- FWCI
- 22.05
- 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: Social processes and proofs of theorems and programs. https://app.cochat.ai/papers/10.1145/359104.359106
- The paper
- De Millo, R. A., Lipton, R. J., & Perlis, A. J. (1979). Social processes and proofs of theorems and programs. Communications of the ACM. https://doi.org/10.1145/359104.359106
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.