
-
Counterexample-Guided Learning of Monotonic Neural Networks
The widespread adoption of deep learning is often attributed to its auto...
read it
-
Scaling Exact Inference for Discrete Probabilistic Programs
Probabilistic programming languages (PPLs) are an expressive means of re...
read it
-
Data-Driven Inference of Representation Invariants
A representation invariant is a property that holds of all values of abs...
read it
-
Overfitting in Synthesis: Theory and Practice (Extended Version)
In syntax-guided synthesis (SyGuS), a synthesizer's goal is to automatic...
read it
-
Overfitting in Synthesis: Theory and Practice (Extender Version)
In syntax-guided synthesis (SyGuS), a synthesizer's goal is to automatic...
read it
-
Overfitting in Synthesis: Theory and Practice
In syntax-guided synthesis (SyGuS), a synthesizer's goal is to automatic...
read it
-
Symbolic Exact Inference for Discrete Probabilistic Programs
The computational burden of probabilistic inference remains a hurdle for...
read it
-
Generating and Sampling Orbits for Lifted Probabilistic Inference
Lifted inference scales to large probability models by exploiting symmet...
read it
-
Data-Driven Loop Invariant Inference with Automatic Feature Synthesis
We present LoopInvGen, a tool for generating loop invariants that can pr...
read it
-
Probabilistic Program Abstractions
Abstraction is a fundamental tool for reasoning about complex systems. P...
read it