289,842 Hits in 3.5 sec

Inductive Synthesis of Functional Programs [chapter]

Emanuel Kitzelmann, Ute Schmid, Martin Mühlpfordt, Fritz Wysotzki
2002 Lecture Notes in Computer Science  
We present an approach to folding of finite program terms based on the detection of recurrence relations in a single given term which is considered as the ¦ th unfolding of an unknown recursive program  ...  Our approach goes beyond Summers' classical approach in several aspects: It is language independent and works for terms belonging to an arbitrary term algebra; it allows induction of sets of recursive  ...  We will give a simple example of inductive program synthesis to illustrate our approach and afterwards present the approach formally.  ... 
doi:10.1007/3-540-45470-5_6 fatcat:4z5b27t7lvhv5j2q2ykz2lb5mi

Inductive Synthesis of Functional Programs by U. Schmid, Springer Verlag, 2003, 420pp, ISBN 3540401741

2007 Journal of functional programming  
It has algorithmic skeletons to express image processing, and these are exploited to generate deep pipelines of highly concurrent and memory-efficient image processing components.  ...  FPGA language designs are often subsets or extensions of existing languages, though these typically lack suitable hardware computation models so compiling them to FPGAs leads to inefficient designs.  ...  Acknowledgements We acknowledge the support of the Engineering and Physical Research Council, grant references EP/K009931/1 (Programmable embedded platforms for remote and compute intensive image processing  ... 
doi:10.1017/s0956796807006296 fatcat:pqkas5xbb5aetcixi62lapgwam

A Combined Analytical and Search-Based Approach for the Inductive Synthesis of Functional Programs

Emanuel Kitzelmann
2010 Künstliche Intelligenz  
The main contribution of my dissertation [4] is the algorithm Igor2 for the induction of functional programs.  ...  Inductive program synthesis addresses the problem of automatically generating (declarative) recursive programs from ambiguous specifications such as input/output examples.  ...  One direction of automated programming is inductive program synthesis or inductive programming (IP) where the problem specification, typically some examples of input/output behavior, is incomplete.  ... 
doi:10.1007/s13218-010-0071-x fatcat:ms3u7dk2hfbxtk55o4q6rcw5te

Neural-Guided Inductive Synthesis of Functional Programs on List Manipulation by Offline Supervised Learning

Yuhong Wang, Xin Li
2021 IEEE Access  
In this work, we propose a method for automatic synthesis of functional programs on list manipulation, by using offline-trained Recurrent Neural Network (RNN) models to guide the program search.  ...  The experiments show promising results on the performance of our method compared to related state-of-the-art inductive synthesizers.  ...  Partly motivated by this observation, we study the effect of offline supervised learning on neural-guided inductive synthesis of functional programs.  ... 
doi:10.1109/access.2021.3079351 fatcat:gpo4rewcxjdqbdakbnllgtfgei

Inductive Synthesis of Recursive Functional Programs [chapter]

Martin Hofmann, Andreas Hirschberger, Emanuel Kitzelmannn, Ute Schmid
Lecture Notes in Computer Science  
recursive target functions • our system Igor [5] formalises functional program synthesis in the term-rewriting framework → functional programs as constructor term rewriting systems Description of Problems  ...  Introduction • Inductive Synthesis of Recursive Programs [1, 4, 5] -challenging subfield of machine learning still little researched niche The Systems • Adate [6] (Automatic Design of Algorithms Through  ... 
doi:10.1007/978-3-540-74565-5_42 fatcat:rj34gc6exzfqxeitzwjhenqaue

Synthesis in Uclid5 [article]

Federico Mora, Kevin Cheang, Elizabeth Polgreen, Sanjit A. Seshia
2020 arXiv   pre-print
To the best of our knowledge, the new version of Uclid5 is the only tool that supports program synthesis with bounded model checking, k-induction, sequential program verification, and hyperproperty verification  ...  We describe an integration of program synthesis into Uclid5, a formal modelling and verification tool.  ...  Acknowledgments This work was supported in part by NSF grants 1739816 and 1837132, a gift from Intel under the SCAP program, SRC Task 2867.001, and the iCyPhy center.  ... 
arXiv:2007.06760v2 fatcat:kacjofzizzf4hkxnb3ovwl63mq

Formal methods for automated program improvement [chapter]

Peter Madden
1994 Lecture Notes in Computer Science  
synthesis of efficient programs from standard equational definitions.  ...  In this paper we report on novel research concerning: (1) the exploitation of synthesis proofs for the purposes of automatie program optimization by the transformation of proofs, andj (2) the automatie  ...  The synthesis of efficient programs from standard equational definitions is achieved through the use of (meta-level) proof-planning techniques.  ... 
doi:10.1007/3-540-58467-6_32 fatcat:jckmgdfumngshiffwn7ibcsc5q

Middle-Out Reasoning for Synthesis and Induction [chapter]

Ina Kraan, David Basin, Alan Bundy
1996 Automated Mathematical Induction  
We propose a novel approach to automating the synthesis of logic programs: Logic programs are synthesized as a by-product of the planning of a veri cation proof.  ...  The approach is a two-level one: At the object level, we prove program veri cation conjectures in a sorted, rst-order theory. The conjectures are of the form 8args ????! : prog(args ????!  ...  Section 2 of this paper discusses related work in program synthesis and selecting induction schemes for synthesis proofs. Section 3 contains a de nition of pure logic programs.  ... 
doi:10.1007/978-94-009-1675-3_4 fatcat:hlrfxol3oreppivyqvd5k7rzyy

Induction of recursive program schemes [chapter]

Ute Schmid, Fritz Wysotzki
1998 Lecture Notes in Computer Science  
Furthermore synthesizing recursive program schemes instead of programs in a predefmed programming language enables us to combine program synthesis and analogical reasoning.  ...  In this paper we present an approach to the induction of recursive structures from examples which is based on the notion of recursive program schemes.  ...  Acknowledgements We thank a number of students participating in our students projects for supporting the implementation of the IPAL system, especially: Mark Miiller and Martin Miihlpfordt.  ... 
doi:10.1007/bfb0026692 fatcat:fvhs7zimt5g3zdnfi6qpkokfxq

Logic Program Synthesis in a Higher-Order Setting [chapter]

David Lacey, Julian Richardson, Alan Smail
2000 Lecture Notes in Computer Science  
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations.  ...  The generality of the approach is such that its extension to allow synthesis of higher-order logic programs was straightforward. Some illustrative examples are given.  ...  We aim at fully automated synthesis. The recursive form of a program synthesised by proof planning is decided by the choice of induction scheme and which variable the induction is performed on.  ... 
doi:10.1007/3-540-44957-4_6 fatcat:24o64zh5abdero5uagownflvka

Page 92 of University Computing : The Bulletin of the IUCC Vol. 12, Issue 3 [page]

1990 University Computing : The Bulletin of the IUCC  
principles, system configuration and main characteristics of an experimental inductive program synthesis system — NDIPS.  ...  Program synthesis is an important testbed for inductive inference. Other applications in inductive inference can be found in Anglain & Smith.’  ... 

Constructing Induction Rules for Deductive Synthesis Proofs

Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques Fleuriot
2006 Electronical Notes in Theoretical Computer Science  
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  ...  Constructive Theorem Proving Proof Program Extraction Program -Functional program prog(i) meeting specification ∀ i.  ...  and the steps of the program they synthesise.  ... 
doi:10.1016/j.entcs.2005.08.003 fatcat:wgcdnm2yxvdl3bxrt2wptuuezi

Middle-out reasoning for synthesis and induction

Ina Kraan, David Basin, Alan Bundy
1996 Journal of automated reasoning  
We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes.  ...  Finding an appropriate induction scheme during synthesis is di cult, because the recursion of the program, which is unknown at the outset, determines the induction in the proof.  ...  Acknowledgements We would like to thank Sophie Renault for her careful reading of this paper. 25  ... 
doi:10.1007/bf00244461 fatcat:ecba53gmabh7zplgxteiy5yu5e

Logic program synthesis

Yves Deville, Kung-Kiu Lau
1994 The Journal of Logic Programming  
> This paper presents an overview and a survey of logic program synthesis.  ...  Three main approaches to logic program synthesis by formal methods are described: constructive synthesis, deductive s y n thesis and inductive synthesis.  ...  We shall rst give a more precise description of inductive synthesis and show t h a t inductive synthesis of recursive logic programs has a speci c niche within Inductive Logic Programming (ILP).  ... 
doi:10.1016/0743-1066(94)90029-9 fatcat:jhxu3lq5yndb7o433tmx4acyqa

Models of inductive synthesis

E.B. Kinber, A.N. Brazma
1990 The Journal of Logic Programming  
program (say, a number in a standard enumeration of all partial recursive functions) computing f.  ...  THE RECURSIVE-THEORETIC APPROACH Till the end of 197Os, inductive synthesis was basically studied on the recursive-theoretic level.  ...  of programs with loops), and finally to reintroduce the loops by folding linear programs using inductive synthesis.  ... 
doi:10.1016/0743-1066(90)90041-3 fatcat:vys7su3ls5hnlgt7wtsdejzb4y
« Previous Showing results 1 — 15 out of 289,842 results