This folder contains the benchmarks used for experiments reported in the following papers:
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, Shetal Shah, "Boolean Functional Synthesis: Hardness and Practical Algorithms", to appear in Formal Methods in System Design
S. Akshay, Supratik Chakraborty, Shubham Goel, Sumith Kulal, and Shetal Shah, "What's hard about Boolean Functional Synthesis?" in Proceedings of 30th International Conference on Computer Aided Verification, 2018
Knowledge Compilation for Boolean Functional Synthesis S. Akshay, Jatin Arora, Supratik Chakraborty, S. Krishna, Divya Raghunathan and Shetal Shah In Formal Methods in Computer-Aided Design (FMCAD), Oct. 2019 [http://theory.stanford.edu/~barrett/fmcad/papers/FMCAD2019_paper_84.pdf]
Tractable Representations for Boolean Functional Synthesis S. Akshay, Supratik Chakraborty and Shetal Shah In Annals of Mathematics and Artificial Intelligence, 2023
Each benchmark is available in aiger/verilog, qdimacs, cnf and nnf format.