BDD-based Boolean functional synthesis

DOI10.1007/978-3-319-41540-6_22MaRDI QIDQ4633560zbMATH OpenOpenAlexFDO

Authors Dror Fried, Lucas M. Tabajara, Moshe Y. Vardi

Publication date 3 May 2019

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

Full work available at URL https://doi.org/10.1007/978-3-319-41540-6_22

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• What's hard about Boolean functional synthesis?
• Boolean functional synthesis: hardness and practical algorithms
• Towards Parallel Boolean Functional Synthesis
• On the relation between BDDs and FDDs
• On the relation between BDDs and FDDs (extended abstract)

Cited in

(13)

• Boolean functional synthesis: hardness and practical algorithms
• A New Look at BDDs for Pseudo-Boolean Constraints
• Towards Parallel Boolean Functional Synthesis
• scientific article; zbMATH DE number 1775052 (Why is no real title available?)
• A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
• What's hard about Boolean functional synthesis?
• Functional synthesis via input-output separation
• Boolean functional synthesis: from under the hood of solvers
• BDD-based decompositions of multiple output logic functions
• ZDD Boolean synthesis
• Counterexample guided knowledge compilation for Boolean functional synthesis
• Tractable representations for Boolean functional synthesis
• On the power of automata minimization in reactive synthesis

This page was built for publication: BDD-based Boolean functional synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633560)