The DOI matches its Crossref record.
Constructing Induction Rules for Deductive Synthesis Proofs
Open accessAbstract
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of correct computer programs from specifications of their desired behaviour. Synthesis of programs with iteration or recursion requires inductive proof, but standard techniques for the construction of appropriate induction rules are restricted to recycling the recursive structure of the specifications. What is needed is induction rule construction techniques that can introduce novel recursive structures. We show that a combination of rippling and the use of meta-variables as a least-commitment device can provide such novelty.
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
Cited by
Adaptation through chromosomal inversions in Anopheles
Ayala, D., Ullastres, A., & González, J. (2014) · Frontiers in Genetics · doi:10.3389/fgene.2014.00129 · Cited by 111
Metadata
- Authors
- Bundy, A., Dixon, L., Gow, J., & Fleuriot, J.
- Venue
- Electronic Notes in Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2006-03
- Volume
- 153
- Issue
- 1
- Pages
- 3-21
- ISSN
- 1571-0661 (ISSN-L)
- OpenAlex
- W2120926795
- Cited by
- 2,806
- References
- 0
- FWCI
- 443.57
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Constructing Induction Rules for Deductive Synthesis Proofs. https://app.cochat.ai/papers/10.1016/j.entcs.2005.08.003
- The paper
- Bundy, A., Dixon, L., Gow, J., & Fleuriot, J. (2006). Constructing Induction Rules for Deductive Synthesis Proofs. Electronic Notes in Theoretical Computer Science. https://doi.org/10.1016/j.entcs.2005.08.003
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.
