To help data scientists visualize raw data that are exploding in quantity, there has been growing interest in using program synthesis to automatically generate visualization programs from user demonstrations. One flavor of such demonstrations is input-output (IO) examples: the user provides tabular input data and demonstrate how to visualize a small number of data points. However, for more complex visualizations, concrete examples are often insufficient for fully expressing user intent, leading to \emph{overfitting}. Moreover, they require the user to provide the exact values (e.g. height of a bar) via laborious manual calculation.

To address those challenges, we propose a new paradigm of visualization synthesis based on \emph{refinement types}. Besides IO examples, the user can optionally use refinement type annotations to constrain the range of valid values in the example visualization or to express complex interactions between different visual components. We develop an efficient bi-directional algorithm to synthesize data transformation and visualization programs that are consistent with refinement type specification.

Wed 15 Jun

Displayed time zone: Pacific Time (US & Canada) change

17:30 - 19:00
Student Research Competition (SRC) Session and ReceptionSRC at Beach North
17:30
90m
Poster
Control Logic Synthesis Using Formal ISA Specifications
SRC
Benjamin Darnell University of California, Santa Barbara
Media Attached
17:30
90m
Poster
Coupled Applicative Functors
SRC
Lisa Vasilenko IMDEA Software Institute
Media Attached
17:30
90m
Poster
Program Synthesis for Processor Development Using Formal Specifications
SRC
Zachary Sisco UC Santa Barbara
Media Attached
17:30
90m
Poster
Path Alignment Automata are Probabilistic Couplings
SRC
Qian Meng Cornell university
Media Attached
17:30
90m
Poster
Multi-Phase Invariant Synthesis
SRC
Daniel Riley Florida State University
Media Attached
17:30
90m
Poster
Finding Good Generators with Multi-Armed Bandits
SRC
Joseph W. Cutler University of Pennsylvania
Media Attached
17:30
90m
Poster
Impacts of Range Reduction on Polynomial Approximation Efficiency
SRC
Sehyeok Park Rutgers University
Media Attached
17:30
90m
Poster
Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)
SRC
Haowei Deng University of Maryland at College Park
Media Attached
17:30
90m
Poster
A Type System for Safe Intermittent Computing
SRC
Milijana Surbatovich Carnegie Mellon University
Media Attached
17:30
90m
Poster
PBUnit: A Live Programming Environment for Unit Testing
SRC
Justin Du University of California, San Diego, Mandeep Syal University of California, San Diego, Thanh-Nha Tran University of California, San Diego
Media Attached
17:30
90m
Poster
Visualization with Refinement Types
SRC
Junrui Liu University of California, Santa Barbara
Media Attached