Hi Everyone,
I hope the POPL deadline is treating you well. As the subject line says, tomorrow I will be giving a practice talk for CAV at 1:30pm in room 3310; if you're awake/alive and are able to attend, I would appreciate the
feedback!
Efficient Synthesis with Probabilistic Constraints.
ABSTRACT. We consider the problem of synthesizing a program given a probabilistic specification of its desired behavior. Specifically, we study the recent paradigm of distribution-guided inductive synthesis (digits), which iteratively calls a synthesizer
on finite samplesets from a given distribution. We make theoretical and algorithmic contributions: (1) We prove the surprising result that digits only requires a polynomial number of synthesizer calls in the size of the samepleset, despite its ostensibly exponential
behavior. (2) We present a property-directed version of digits that further reduces the number of synthesizer calls, drastically reducing synthesis time on a range of benchmarks.
Best,
Samuel Drews
![[Computer Systems Lab]](http://www.cs.wisc.edu/pics/csl_logo.gif){kind=logo}