Citation Context

...ubmission to make it correct. 7.6 Program Synthesis Program synthesis has been used recently for many applications such as synthesis of efficient low-level code [29, 38], data structure manipulations =-=[34]-=-, inference of efficient synchronization in concurrent programs [43], snippets of excel macros [18, 33], relational data representations [19, 20] and angelic programming [8]. The SKETCH tool [37, 38] ...

Citation Context

...cently to synthesize many classes of non-trivial algorithms, e.g. graph algorithms [13], bit-streaming programs [26, 9], program inverses [27], interactive code snippets [11, 19], and data-structures =-=[24, 25]-=-. There are a range of techniques used in these systems including exhaustive search, constraint-based reasoning, probabilistic inference, type-based search, theorem proving and version-space algebra. ...

Citation Context

... be an intuitive and effective style for programming finite-state reactive controllers [9–11], Excel macros performing string manipulations [7], and pointer-manipulations for updating data structures =-=[22]-=-. This paper focuses on programming reactive systems such as distributed protocols. For such protocols, although the core algorithms are published with accompanying correctness proofs and performance ...

Citation Context

... procedure for quantitative synthesis should aim to meet its boolean and quantitative objectives simultaneously. The benefits of such an approach are corroborated by prior work on (boolean) synthesis =-=[28, 34]-=-, which combines synthesis and verification to make the overall process more tractable. In this paper, we offer such a combined verification and synthesis procedure for the problem of synthesizing val...

Citation Context

... design our methodology to support concrete reasoning. Program synthesis has had numerous successes at synthesizing code in small well-defined domains such as bitvector logic [13] and data structures =-=[30, 11]-=- as well as somewhat more general classes of programs [31, 14, 32]. As they are backed by decision procedures and SMT solvers, these techniques are very efficient in certain domains that have been ful...

Citation Context

...y the interface. Algorithms such at Prospector [66] solve exactly this issue, synthesising such glue code from input and output types. Similarly, ‘programming by sketching’ or ‘storyboard’ approaches =-=[84]-=- synthesise working algorithms in the presence given structured but incomplete information about the contents. Finally, if user annotations take the form of contracts or specifications, recent advance...

Citation Context

... size is small, as in our active learning scenarios. In recent years, the programming languages community has been working on programming-by-example problems to synthesize different types of programs =-=[21, 10, 9]-=-. Our work differs from previous tools in that we require a feature selection mechanism in place in order to provide reasonable results. The work of Gulwani in [9] proposes querying the user to provid...

Citation Context

...n computing repairs as winning strategies in games [18], abstraction interpretation [21], mutations [12], genetic algorithms [2,15], using contracts [31], and focusing on data structure manipulations =-=[27, 32]-=-. There are also customized program repair engines for grading and feedback generation for programming assignments, cf. [26]. Finally, a multitude of algorithms [4,9,19,33] have been proposed for faul...

Citation Context

...ructure manipulations by combining various forms of insights, including abstract and concrete input-output examples as well as implementation skeletons. Our tool is based on a new synthesis algorithm =-=[4]-=- that combines abstractinterpretation based shape-analysis [2, 3] with constraint-based synthesis [5, 7, 8]. The algorithm uses an abstraction refinement based approach to concisely encode synthesis c...