Eecient Robdd Operations for Program Analysis
نویسنده
چکیده
Reduced Ordered Binary Decision Diagrams (ROB-DDs), also known as Bryant graphs, are a representation for Boolean functions supporting many eecient operations. Because of this, they have often been used to implement the positive Boolean functions for program analysis. Some ROBDD operations heavily used in program analysis, however, are still rather expensive. The undertaking of the present paper is to develop some more eecient algorithms for a few key ROBDD operations used in program analysis.
منابع مشابه
Widening ROBDDs with Prime Implicants
Despite the ubiquity of ROBDDs in program analysis, and extensive literature on ROBDD minimisation, there is a dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only...
متن کاملNew Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Extended Abstract)
We identify two families of canonical representations called ROBDD[∧î]C and ROBDD[∧T̂ ,i]T by augmenting ROBDD with two types of conjunctive decompositions. These representations cover the three existing languages ROBDD, ROBDD with as many implied literals as possible (ROBDDL∞), and AND/OR BDD. We introduce a new time efficiency criterion called rapidity which reflects the idea that exponential ...
متن کاملAugmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition
This paper augments OBDD with conjunctive decomposition to propose a generalization called OBDD[∧]. By imposing reducedness and the finest ∧-decomposition bounded by integer i (∧î-decomposition) on OBDD[∧], we identify a family of canonical languages called ROBDD[∧î], where ROBDD[∧0̂] is equivalent to ROBDD. We show that the succinctness of ROBDD[∧î] is strictly increasing when i increases. We i...
متن کاملEfficient Scheduling Techniques for ROBDD Construction
The most common way to build the reduced ordered binary decision diagram (ROBDD) of a complex gate (or function) f of a network is bottom-up, i.e., by rst building the ROBDDs of the sub-expressions of f and then suitably combining them. Such a method, however, has been found to su er from memory explosion, even when the ROBDD of f is not large. This leads to the following fundamental question: ...
متن کاملEecient Robdd Based Computation of Common Decomposition Functions of Multi-output Boolean Functions
One of the crucial problems multi-level logic synthesis techniques for multi-output boolean functions f =
متن کامل