Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions
Abstract elided by the publisher.
Related papers
- A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking CAV 1996
- Dynamic Programming for Symbolic Boolean Realizability and Synthesis CAV 2024
- ZDD Boolean Synthesis TACAS 2022
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking CAV 2000
- Symbolic Model Checking without BDDs TACAS 1999
- BDD-Based Boolean Functional Synthesis CAV 2016
- Polynomial Bounds of CFLOBDDs against BDDs TOPLAS 2025
- CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams TOPLAS 2024