Write a Blog >>
PLDI 2020
Mon 15 - Fri 19 June 2020
Fri 19 Jun 2020 08:20 - 08:40 at PLDI Research Papers live stream - Synthesis III Chair(s): Santosh Nagarakatte

Interactive program synthesis aims to solve the ambiguity in specifications, and selecting the proper question to minimize the rounds of interactions is critical to the performance of interactive program synthesis. In this paper we address this question selection problem and propose two algorithms. \textit{SampleSy} approximates a state-of-the-art strategy proposed for optimal decision tree and has a short response time to enable interaction. \textit{EpsSy} further reduces the rounds of interactions by approximating \textit{SampleSy} with a bounded error rate. To implement the two algorithms, we further propose \textit{VSampler}, an approach to sampling programs from a probabilistic context-free grammar based on version space algebra. The evaluation shows the effectiveness of both algorithms.

Fri 19 Jun
Times are displayed in time zone: Pacific Time (US & Canada) change

08:00 - 09:00
Exact and Approximate Methods for Proving Unrealizability of Syntax-Guided Synthesis Problems
PLDI Research Papers
Qinheping HuUniversity of Wisconsin-Madison, USA, John CyphertUniversity of Wisconsin-Madison, USA, Loris D'AntoniUniversity of Wisconsin-Madison, USA, Thomas RepsUniversity of Wisconsin-Madison, USA
Question Selection for Interactive Program Synthesis
PLDI Research Papers
Ruyi JiPeking University, China, Jingjing LiangPeking University, China, Yingfei XiongPeking University, China, Lu ZhangPeking University, China, Zhenjiang HuPeking University, China
Reconciling Enumerative and Deductive Program Synthesis
PLDI Research Papers
Kangjing HuangPurdue University, USA, Xiaokang QiuPurdue University, USA, Peiyuan ShenPurdue University, USA, Yanjun WangPurdue University, USA