CoChat

Synthesis modulo recursive functions

Open access
Kneuss, Etienne, Kuraj, Ivan, Kuncak, Viktor, Suter, Philippe · 2013 · Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Cited by 109

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

Abstract

We describe techniques for synthesis and verification of recursive functional programs over unbounded domains. Our techniques build on top of an algorithm for satisfiability modulo recursive functions, a framework for deductive synthesis, and complete synthesis procedures for algebraic data types. We present new counterexample-guided algorithms for constructing verified programs. We have implemented these algorithms in an integrated environment for interactive verification and synthesis from relational specifications. Our system was able to synthesize a number of useful recursive functions that manipulate unbounded numbers and data structures.

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.

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

Integrity signals

Registry

Crossref · 10.1145/2509136.2509555

Cites

4 of 4 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.

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.

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 4 references

Cited by

See all 109

Metadata

Authors
Kneuss, E., Kuraj, I., Kuncak, V., & Suter, P.
Venue
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Publisher
ACM
Published
2013-10-29
Pages
407-426
OpenAlex
W2091385303
Cited by
109
References
4
FWCI
9.54
Type
conference paper
Language
en
Open access
green

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: Synthesis modulo recursive functions. https://app.cochat.ai/papers/10.1145/2509136.2509555
The paper
Kneuss, E., Kuraj, I., Kuncak, V., & Suter, P. (2013). Synthesis modulo recursive functions. Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications. https://doi.org/10.1145/2509136.2509555

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.