The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Deductive Approach to Program Synthesis
Abstract
Program synthesis is the systematic derivation of a program from a given specification. A deductive approach to program synthesis is presented for the construction of recursive programs. This approach regards program synthesis as a theorem-proving task and relies on a theorem-proving method that combines the features of transformation rules, unification, and mathematical induction within a single framework.
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
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
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
Green, C. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50019-2 · Cited by 456
Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
Hewitt, C. E. (1972) · Defense Technical Information Center (DTIC) · Cited by 316
Proving Theorems about LISP Functions
Boyer, R. S., & Moore, J. S. (1975) · Journal of the ACM · doi:10.1145/321864.321875 · Cited by 256
Non-resolution theorem proving
Bledsoe, W. W. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90012-1 · Cited by 229
Manna, Z., & Waldinger, R. J. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234198 · Cited by 155
Self-citationPROW: a step toward automatic program writing
Waldinger, R. J., & Lee, R. C. T. (1969) · International Joint Conference on Artificial Intelligence · Cited by 114
Self-citation
Cited by
Large Language Models for Software Engineering: A Systematic Literature Review
Hou, X., Zhao, Y., Liu, Y., Yang, Z., Wang, K., Li, L., Luo, X., Lo, D., Grundy, J., & Wang, H. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3695988 · Cited by 1,029
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
Oracle-guided component-based program synthesis
Jha, S., Gulwani, S., Seshia, S. A., & Tiwari, A. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806833 · Cited by 510
GitHub Copilot AI pair programmer: Asset or Liability?
Moradi Dakhel, A., Majdinasab, V., Nikanjam, A., Khomh, F., Desmarais, M. C., & Jiang, Z. M. (. (2023) · Journal of Systems and Software · doi:10.1016/j.jss.2023.111734 · Cited by 417
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
“Program synthesis traditionally meant deductive synthesis (Manna & Waldinger, 1980), where the goal is to build a programs from a full specification, where a specification precisely states the requirements and behaviour of the desired program.”
BackgroundMethod
Metadata
- Authors
- Manna, Z., & Waldinger, R.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1980-01
- Volume
- 2
- Issue
- 1
- Pages
- 90-121
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2012436850
- Cited by
- 573
- References
- 10
- FWCI
- 12.28
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Deductive Approach to Program Synthesis. https://app.cochat.ai/papers/10.1145/357084.357090
- The paper
- Manna, Z., & Waldinger, R. (1980). A Deductive Approach to Program Synthesis. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/357084.357090
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.
