What's hard about Boolean functional synthesis?

DOI10.1007/978-3-319-96145-3_14zbMath1511.68146arXiv1804.05507MaRDI QIDQ6045007

Supratik Chakraborty, Shetal Shah, S. Akshay, Sumith Kulal, Shubham Goel

Publication date: 26 May 2023

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.05507

zbMATH Keywords

synthesisSkolem functionsSAT solversCEGAR-based approach

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Functional synthesis via input-output separation ⋮ Boolean functional synthesis: from under the hood of solvers ⋮ Preface of the special issue on the conference on computer-aided verification 2018 ⋮ Certified DQBF solving by definition extraction

This page was built for publication: What's hard about Boolean functional synthesis?