Improving the efficiency of BDD-based operators by means of partitioning
- 1 May 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 18 (5) , 545-556
- https://doi.org/10.1109/43.759068
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Partitioned ROBDDs-a compact, canonical and efficiently manipulable representation for Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved reachability analysis of large finite state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Verification and synthesis of counters based on symbolic techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Binary decision diagrams and beyond: enabling technologies for formal verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Memory optimization in function and set manipulation with BDDsSoftware: Practice and Experience, 1998
- Reachability analysis using partitioned-ROBDDsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Some heuristics for generating tree-like FBDD typesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- Symbolic model checking for sequential circuit verificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986