1.1k citations · 1.2k across the 14 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.PL2016
Approaching Symbolic Parallelization by Synthesis of Recurrence Decompositions
Grigory Fedyukovich, Rastislav Bodík
We present GraSSP, a novel approach to perform automated parallelization relying on recent advances in formal verification and synthesis. GraSSP augments an existing sequential pro…
cs.AI2016★ 11 cited
Swift: Compiled Inference for Probabilistic Programming Languages
Yi Wu, Lei Li, Stuart Russell +1
A probabilistic program defines a probability measure over its semantic structures. One common goal of probabilistic programming languages (PPLs) is to compute posterior probabilit…
cs.PL2016★ 1 cited
SIMPL: A DSL for Automatic Specialization of Inference Algorithms
Rohin Shah, Emina Torlak, Rastislav Bodik
Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a quer…