Oleksandr Polozov

Suggest Changes
Sumit Gulwani19
Sanjit A. Seshia10
Vu Le8
Armando Solar-Lezama7
Rishabh Singh7
16Sumit Gulwani
6Kevin Ellis
5Armando Solar-Lezama
5Daniel Ritchie
5Patrick Kreutzer

Filter Results:

  • Full text PDF available (8)

Publication Year

2014
2017
  • This year (2)
  • Last 5 years (8)
  • Last 10 years (8)

Publication Type

Co-author

Publication Venue

Key Phrases

Learn More
Learning Syntactic Program Transformations from Examples
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)
User Interaction Models for Disambiguation in Programming by Example
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)
Personalized Mathematical Word Problem Generation
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)
Structure and Term Prediction for Mathematical Text
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)
LaSEWeb: automating search strategies over semi-structured web data
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)
Interactive Program Synthesis
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)
Program Synthesis in the Industrial World: Inductive, Incremental, Interactive
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)
  • ‹
  • 1
  • ›