The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
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.
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.
Integrity signals
Registry
Cites
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.
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
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Boyer, R. S., & Moore, J. S. (1979) · Cited by 883
The integration of functions into logic programming: From theory to practice
Hanus, M. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90034-5 · Cited by 419
IsaPlanner: A Prototype Proof Planner in Isabelle
Dixon, L., & Fleuriot, J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45085-6_22 · Cited by 201
Self-citationOn proving the termination of algorithms by machine
Walther, C. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90063-9 · Cited by 69
Cited by
A Taxonomy of Model Transformation
Mens, T., & Van Gorp, P. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.10.021 · Cited by 908
Pex–White Box Test Generation for .NET
Tillmann, N., & de Halleux, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79124-9_10 · Cited by 791
Bagnara, R., Hill, P. M., & Zaffanella, E. (2008) · Science of Computer Programming · doi:10.1016/j.scico.2007.08.001 · Cited by 477
XMIPP: a new generation of an open-source image processing package for electron microscopy
Sorzano, C. O. S., Marabini, R., Velázquez-Muriel, J., Bilbao-Castro, J. R., Scheres, S. H. W., Carazo, J. M., & Pascual-Montano, A. (2004) · Journal of Structural Biology · doi:10.1016/j.jsb.2004.06.006 · Cited by 469
Automated Security Protocol Analysis With the AVISPA Tool
Viganò, L. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2005.11.052 · Cited by 452
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
- 5
- 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
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.