Filter Results:
- Full text PDF available (9)
Publication Year
2014
2017
- This year (3)
- Last 5 years (9)
- Last 10 years (9)
Publication Type
Co-author
Journals and Conferences
Key Phrases
Learn More
- Oleksandr Polozov, Sumit Gulwani
- OOPSLA
- 2015
Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming. However, designing, developing, and maintaining an effective industrial-quality inductive synthesizer is an intellectual and engineering challenge, requiring 1-2 man-years of effort. Our novel… (More)
- Reudismam Rolim, Gustavo Soares, +5 authors Björn Hartmann
- 2017 IEEE/ACM 39th International Conference on…
- 2017
Automatic program transformation tools can be valuable for programmers to help them with refactoring tasks, and for Computer Science students in the form of tutoring systems that suggest repairs to programming assignments. However, manually creating catalogs of transformations is complex and time-consuming. In this paper, we present REFAZER, a technique for… (More)
- Mikaël Mayer, Gustavo Soares, +6 authors Sumit Gulwani
- UIST
- 2015
Programming by Examples (PBE) has the potential to revolutionize end-user programming by enabling end users, most of whom are non-programmers, to create small scripts for automating repetitive tasks. However, examples, though often easy to provide, are an ambiguous specification of the user's intent. Because of that, a key impedance in adoption of PBE… (More)
Word problems are an established technique for teaching mathematical modeling skills in K-12 education. However, many students find word problems unconnected to their lives, artificial, and uninteresting. Most students find them much more difficult than the corresponding symbolic representations. To account for this phenomenon, an ideal pedagogy might… (More)
Mathematical text is too cumbersome to write because of the need to encode a tree structure in a left to right linear order. This paper defines two novel problems, namely structure prediction from unstructured representation and sequence prediction within a mathematical session, to help address mathematical text entry. The effectiveness of our approach… (More)
- Oleksandr Polozov, Sumit Gulwani
- KDD
- 2014
We show how to programmatically model processes that humans use when extracting answers to queries (e.g., "Who invented typewriter?", "List of Washington national parks") from semi-structured Web pages returned by a search engine. This modeling enables various applications including automating repetitive search tasks, and helping search engine developers… (More)
Programming by example (PBE), or inductive synthesis is a subfield of program synthesis where specification on a target program is provided in a form of input-output examples or, more generally, constraints on the output [9]. While research in PBE dates back as far as 1980s [8], its mass-market applications only appeared in the last decade. PBE has gained… (More)
Program synthesis from incomplete specifications (e.g. input-output examples) has gained popularity and found real-world applications, primarily due to its ease-of-use. Since this technology is often used in an interactive setting, efficiency and correctness are often the key user expectations from a system based on such technologies. Ensuring efficiency is… (More)
We address the problem of learning comprehensive syntactic profiles for a set of strings. Real-world datasets, typically curated from multiple sources, often contain data in various formats. Thus any data processing task is preceded by the critical step of data format identification. However, manual inspection of data to identify various formats is… (More)
- ‹
- 1
- ›