. Moreover, it has also received the best paper award nomination
We present an approach that combines advances in machine learning with automated reasoning for efficiently synthesizing functions with explicit dependencies.
Joint work with: Subhajit Roy and Kuldeep S. Meel
Our paper on Synthesis with Explicit Dependencies has been accepted to
Excited to attend a fully packed
Happy to present first in-person tutorial :) We will be talking about
Highlights of Logic, Games and Automata
. I will be talking about our work on program synthesis as dependency quantified formulas. Also, looking forward to visit Pierre Marquis and Daniel Le Berre as a part of Highlights Extended Stay Program.
I am attending
I am visiting Simons institute to attend the reunion for
Our work on A Scalable Shannon Entropy Estimator is accepted to CAV-22.
We propose the first efficient algorithmic technique to estimate the Shannon entropy of a specification with PAC-style guarantees, i.e., the computed estimate is guaranteed to lie within a (1 ± ε)-factor of the ground truth with confidence >= 1−δ.
Joint work with: Brendan Juba and Kuldeep S. Meel
Our work On Quantitative Testing of Samplers has been accepted to CP-22.
We design a computational hardness-based tester, called ScalBarbarik. ScalBarbarik provides a qunatitative way to analysis the quality of a sampler.
Joint work with: Mate Soos, Sourav Chakraborty, Kuldeep S. Meel