ZDD Boolean synthesis

DOI10.1007/978-3-030-99524-9_4zbMATH Open1547.68439MaRDI QIDQ6535560FDOQ6535560

Authors: Yi Lin, Lucas M. Tabajara, Moshe Y. Vardi Edit this on Wikidata

Publication date: 23 January 2024

Recommendations

• BDD-based Boolean functional synthesis
• What's hard about Boolean functional synthesis?
• Tractable representations for Boolean functional synthesis
• Boolean functional synthesis: hardness and practical algorithms
• Towards Parallel Boolean Functional Synthesis

zbMATH Keywords

resolutionbinary decision diagramquantifier eliminationzero-suppressed binary decision diagramBoolean synthesis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites Work

• Title not available (Why is that?)
• Graph-Based Algorithms for Boolean Function Manipulation
• Principles and Practice of Constraint Programming – CP 2004
• Title not available (Why is that?)
• Title not available (Why is that?)
• Local and global relational consistency
• BDD-based Boolean functional synthesis
• Incremental determinization
• What's hard about Boolean functional synthesis?
• ProCount: weighted projected model counting with graded project-join trees
• Functional synthesis via input-output separation

Cited In (4)

• Functional synthesis via input-output separation
• Tractable representations for Boolean functional synthesis
• Counterexample guided knowledge compilation for Boolean functional synthesis
• Boolean recombinase-based devices

This page was built for publication: ZDD Boolean synthesis

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