• Classified by Research Topic • Sorted by Date • Classified by Publication Type •

** Synthesis with Explicit Dependencies**.

Priyanka Golia, Subhajit Roy and Kuldeep S. Meel.

In * Proceedings of Design, Automation, and Test in Europe(DATE)*, April 2023.

** Best Paper Award Nomination**

Quantified Boolean Formulas (QBF) extend propositional logic with universal and existential quantification. In QBF, an existentially quantified variable is allowed to depend on all universally quantified variables in its scope. Dependency Quantified Boolean Formulas (DQBF) restrict the dependencies of existentially quantified variables. In DQBF, existentially quantified variables have explicit dependencies on a subset of universally quantified variables, called Henkin dependencies. Given a Boolean specification between the set of inputs and outputs, the problem of Henkin synthesis is to synthesize each output variable as a function of its Henkin dependencies such that the specification is met. Henkin synthesis has wide-ranging applications, including verification of partial circuits, controller synthesis, and circuit realizability. This work proposes a data-driven approach for Henkin synthesis called HSynth. On an extensive evaluation of over 563 instances arising from past DQBF solving competitions, we demonstrate thatHSynth is competitive with state-of-the-art tools. Furthermore, HSynth solves 26 benchmarks that none of the current state-ofthe-art techniques could solve

@inproceedings{GRM23, title={Synthesis with Explicit Dependencies}, author={Golia, Priyanka and Roy, Subhajit and Meel, Kuldeep S.}, bib2html_pubtype={Refereed Conference,Award Winner}, month=apr, year={2023}, bib2html_rescat={Synthesis}, note={Best Paper Award Nomination}, bib2html_dl_pdf={../Papers/date23.pdf}, booktitle=DATE, abstract={Quantified Boolean Formulas (QBF) extend propositional logic with universal and existential quantification. In QBF, an existentially quantified variable is allowed to depend on all universally quantified variables in its scope. Dependency Quantified Boolean Formulas (DQBF) restrict the dependencies of existentially quantified variables. In DQBF, existentially quantified variables have explicit dependencies on a subset of universally quantified variables, called Henkin dependencies. Given a Boolean specification between the set of inputs and outputs, the problem of Henkin synthesis is to synthesize each output variable as a function of its Henkin dependencies such that the specification is met. Henkin synthesis has wide-ranging applications, including verification of partial circuits, controller synthesis, and circuit realizability. This work proposes a data-driven approach for Henkin synthesis called HSynth. On an extensive evaluation of over 563 instances arising from past DQBF solving competitions, we demonstrate thatHSynth is competitive with state-of-the-art tools. Furthermore, HSynth solves 26 benchmarks that none of the current state-ofthe-art techniques could solve}, }

Generated by bib2html.pl (written by Patrick Riley with layout from Sanjit A. Seshia ) on Sun Apr 14, 2024 11:15:51