Priyanka
Priyanka
Home
CV
News
Publications
Software
Light
Dark
Automatic
Page not found
Perhaps you were looking for one of these?
Latest
Functional Synthesis via Formal Methods and Machine Learning
Ph.D. Done! Successfully defended my Ph.D. thesis, "Functional Synthesis via Formal Methods and Machine Learning." <br> Thankful to my amazing advisors, Kuldeep S. Meel and Subhajit Roy.
Our paper <a href="files/publications/cav-22-entropy.pdf">A Scalable Shannon Entropy Estimator</a> is invited to appear in </code> <a href="https://www.springer.com/journal/10703">Formal Methods in System Design (FMSD)</a> issue dedicated to the best papers from CAV 2022.
Synthesis with Explicit Dependencies
Our paper on Synthesis with Explicit Dependencies has been accepted to <a href="https://www.date-conference.com/">DATE 2023</a>. Moreover, it has also received the <b>best paper award nomination</b>.<br>We present an approach that combines advances in machine learning with automated reasoning for efficiently synthesizing functions with explicit dependencies.<br>Joint work with: Subhajit Roy and Kuldeep S. Meel<br>
Excited to attend a fully packed <a href = "https://www.floc2022.org/">FLoC-22</a>. We will be presenting:<br> <ul> <li> <a href="files/slides/qbf_workshop.pdf"> A data-driven approach for Boolean functional synthesis </a> at QBF workshop. </li> <li> <a href="files/slides/dpcp.pdf">Boolean functional synthesis and its applications </a> at CP doctoral program.</li> <li><a href="files/slides/fmcad21.pdf">Designing sampler is easy: the boon of testers </a> at Model counting workshop.</li> <li> <a href="files/publications/cp22_shakuni.pdf">On quantitative testing of sampler </a> at CP 2022.</li> <li> <a href="files/publications/cav-22-entropy.pdf">A scalable Shannon entropy estimator </a> at CAV 2022.</li></ul>
Happy to present first in-person tutorial :) We will be talking about <a href="ijcai22-tutorial/index.html">automated synthesis</a> at IJCAI-22.
I am attending <a href="https://highlights-conference.org/2022/">Highlights of Logic, Games and Automata</a>. 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 visiting Simons institute to attend the reunion for <a href="https://simons.berkeley.edu/programs/sat2021">Satisfiability: Theory, Practice, and Beyond </a> program. I will be presenting our work on program synthesis as dependency quantified formulas.
<b>Our work on A Scalable Shannon Entropy Estimator is accepted to <a href="http://i-cav.org/2022/">CAV-22</a>.</b> <br> 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−δ. <br> Joint work with: Brendan Juba and Kuldeep S. Meel<br>
Cite
×