Approximation and Decomposition of Binary Decision Diagrams

Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and model checking algorithms have emphasized the need for efficient algorithms for the approximation and decomposition of BDDs. In this paper we present a new algorithm for approximation and analyze its performance in comparison with existing techniques. We also introduce a new decomposition algorithm that produces balanced partitions. The effectiveness of our contributions is demonstrated by improved results in reachability analysis for some hard problem instances.

• Type: Conference
• Year: 1998
• Where: DAC
• Authors: Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple, Fabio Somenzi
• Keywords: DAC 1998, Design Automation, Hard Problem Instances, Model Checking Algorithms, Reachability Analysis