Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 267

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

From program verification to program synthesis

Srivastava, Saurabh, Gulwani, Sumit, Foster, Jeffrey S.·2010·Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Abstract

This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier by allowing programs to be specified at a higher-level than executable code. In our approach, which we call proof-theoretic synthesis, the user provides an input-output functional specification, a description of the atomic operations in the programming language, and a specification of the synthesized program's looping structure, allowed stack space, and bound on usage of certain operations. Our technique synthesizes a program, if there exists one, that meets the input-output specification and uses only the given resources.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1706299.1706337

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 267

Metadata

Authors
Srivastava, S., Gulwani, S., & Foster, J. S.
Venue
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher
ACM
Published
2010-01-17
Pages
313-326
OpenAlex
W2101432564
Cited by
267
References
3
FWCI
25.47
Type
conference paper
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: From program verification to program synthesis. https://app.cochat.ai/papers/10.1145/1706299.1706337
The paper
Srivastava, S., Gulwani, S., & Foster, J. S. (2010). From program verification to program synthesis. Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/1706299.1706337

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.