ZDD Boolean synthesis

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

Yi Lin, Lucas M. Tabajara, Moshe Y. Vardi

Publication date: 23 January 2024

zbMATH Keywords

quantifier eliminationresolutionbinary decision diagramzero-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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local and global relational consistency
• ProCount: weighted projected model counting with graded project-join trees
• Incremental Determinization
• Graph-Based Algorithms for Boolean Function Manipulation
• BDD-Based Boolean Functional Synthesis
• Principles and Practice of Constraint Programming – CP 2004
• What's hard about Boolean functional synthesis?
• Functional synthesis via input-output separation

This page was built for publication: ZDD Boolean synthesis