Example-directed synthesis: a type-theoretic interpretation

Frankle, Jonathan; Osera, Peter-Michael; Walker, David; Zdancewic, Steve

doi:10.1145/2837614.2837629

Cited by 56 publications

(23 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, Polikarpova et al synthesized recursive functions satisfying a specification in the form of polymorphic refinement types [25]. Zdancewic et al demonstrated that examples in exampledirected synthesis can be interpreted as refinement types [16]. They provided an example-based specification language by using intersection types with singletons.…”

Section: Type-theoretical Specificationmentioning

confidence: 99%

“…The main difference is the way of specification. Like in many traditional synthesis approaches [16,17,28,32], targets in [27] are specified by using properties of executed programs. More specifically, relations on inputs and outputs are defined.…”

Section: Smtmentioning

confidence: 99%

“…Software synthesis is an established research topic that offers a broad range of specification formalisms such as examples [16,17,28,32], types [16,20,25] or first-order-logic [27,31]. For this paper, we followed the intuition that the joint usage of (complementary) formalisms can yield a synthesis approach that combines the respective strengths of the underlying techniques.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories

Kallat

Schäfer

Vasileva

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We introduce an approach that aims to combine the usage of satisfiability modulo theories (SMT) solvers with the Combinatory Logic Synthesizer (CL)S framework. (CL)S is a tool for the automatic composition of software components from a user-specified repository. The framework yields a tree grammar that contains all composed terms that comply with a target type. Type specifications for (CL)S are based on combinatory logic with intersection types. Our approach translates the tree grammar into SMT functions, which allows the consideration of additional domain-specific constraints. We demonstrate the usefulness of our approach in several experiments.

show abstract

Section: Type-theoretical Specificationmentioning

confidence: 99%

Section: Smtmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories

Kallat

Schäfer

Vasileva

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…ESHER [1] and LaSy [18] use a set of input/output examples and a set of program components to automatically synthesize progressively more complicated code snippets, until one is discovered which satisfies all input-output pairs. In [6], the authors use a type-based approach, where an input/output example is viewed as a singleton refinement type. A solution is satisfactory if its type is a supertype of all provided examples.…”

Section: Related Workmentioning

confidence: 99%

An Update on Deductive Synthesis and Repair in the Leon Tool

Koukoutos

Kneuss

Kunčak

2016

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We report our progress in scaling deductive synthesis and repair of recursive functional Scala programs in the Leon tool. We describe new techniques, including a more precise mechanism for encoding the space of meaningful candidate programs. Our techniques increase the scope of synthesis by expanding the space of programs we can synthesize and by reducing the synthesis time in many cases. As a new example, we present a run-length encoding function for a list of values, which Leon can now automatically synthesize from specification consisting of the decoding function and the local minimality property of the encoded value.Comment: In Proceedings SYNT 2016, arXiv:1611.0717

show abstract

“…We address this challenge with an enhanced type-directed search algorithm. Due to the scalability issue, prior work on functional program synthesis [Feser et al 2015;Frankle et al 2016;Osera and Zdancewic 2015;Polikarpova et al 2016] use type-directed search techniques. Although the technique can reduce the search space substantially, type-directed search alone was still unscalable to repair nontrivial student submissions.…”

Section: Introductionmentioning

confidence: 99%

Automatic diagnosis and correction of logical errors for functional programming assignments

Lee

Song

et al. 2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present FixML, a system for automatically generating feedback on logical errors in functional programming assignments. As functional languages have been gaining popularity, the number of students enrolling functional programming courses has increased significantly. However, the quality of feedback, in particular for logical errors, is hardly satisfying. To provide personalized feedback on logical errors, we present a new errorcorrection algorithm for functional languages, which combines statistical error-localization and type-directed program synthesis enhanced with components reduction and search space pruning using symbolic execution. We implemented our algorithm in a tool, called FixML, and evaluated it with 497 students' submissions from 13 exercises, including not only introductory but also more advanced problems. Our experimental results show that our tool effectively corrects various and complex errors: it fixed 43% of the 497 submissions in 5.4 seconds on average and managed to fix a hard-to-find error in a large submission, consisting of 154 lines. We also performed user study with 18 undergraduate students and confirmed that our system actually helps students to better understand their programming errors. CCS Concepts: • Software and its engineering → Automatic programming; Functional languages;

show abstract

Example-directed synthesis: a type-theoretic interpretation

Cited by 56 publications

References 18 publications

CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories

CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories

An Update on Deductive Synthesis and Repair in the Leon Tool

Automatic diagnosis and correction of logical errors for functional programming assignments

Contact Info

Product

Resources

About